Computing the Integer Programming Gap
Hosten, Serkan · Sturmfels, Bernd
Optimization and Control
Commutative Algebra
Combinatorics
90C10 (Primary), 13P10, 62H17 (Secondary)
Original · EN
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.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.