Computing the Integer Programming Gap
classification
🧮 math.OC
math.ACmath.CO
keywords
fixedintegerprogrammingcomputedcomputingcostdecompositiondetermine
read the original abstract
We determine the maximal gap between the optimal values of an integer program and its linear programming relaxation, where the matrix and cost function are fixed but the right hand side is unspecified. Our formula involves irreducible decomposition of monomial ideals. The gap can be computed in polynomial time when the dimension is fixed.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.