Extensions of the Group Theoretic Approach in Integer Programming
From MaRDI portal
Cited in
(13)- The b-hull of an integer program
- An extension of Hu's group minimization algorithm
- The value function of a mixed integer program. II
- Standard pairs and group relaxations in integer programming
- A number theoretic reformulation and decomposition method for integer programming
- Integer programming, Barvinok's counting algorithm and Gomory relaxations.
- On the lattice programming gap of the group problems
- Generating functions and duality for integer programs
- Coefficient reduction for inequalities in 0–1 variables
- Improved integer programming bounds using intersections of corner polyhedra
- On the facial structure of set packing polyhedra
- Computational experience with a group theoretic integer programming algorithm
- Generalized dynamic programming methods in integer programming
This page was built for publication: Extensions of the Group Theoretic Approach in Integer Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650209)