An Adaptive Group Theoretic Algorithm for Integer Programming Problems
From MaRDI portal
Publication:5635258
Cited in
(10)- Solution approaches for highly primal- and dual-degenerate all-integer programming problems
- An extension of Hu's group minimization algorithm
- Cutting-plane theory: Algebraic methods
- A solution method for a knapsack problem and its variant
- A new storage reduction technique for the solution of the group problem
- Improved integer programming bounds using intersections of corner polyhedra
- Prediction with zero‐one loss structure
- Computational experience with a group theoretic integer programming algorithm
- Generalized dynamic programming methods in integer programming
- Alternative group relaxation of integer programming problems
This page was built for publication: An Adaptive Group Theoretic Algorithm for Integer Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5635258)