Characterizes classes of convex sets yielding finite integrality gaps for convex MIPs, supplies gap estimates for two classes, and demonstrates that polyhedral approximations can produce arbitrarily poor gap bounds.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
On the integrality gap of convex mixed-integer programs
Characterizes classes of convex sets yielding finite integrality gaps for convex MIPs, supplies gap estimates for two classes, and demonstrates that polyhedral approximations can produce arbitrarily poor gap bounds.