Improving Integrality Gaps via Chvátal-Gomory Rounding
From MaRDI portal
Publication:3588421
DOI10.1007/978-3-642-15369-3_28zbMath1306.90138OpenAlexW1487406052MaRDI QIDQ3588421
Publication date: 10 September 2010
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_28
Related Items (6)
Approximation Limits of Linear Programs (Beyond Hierarchies) ⋮ Partial degree bounded edge packing problem for graphs and \(k\)-uniform hypergraphs ⋮ Theoretical challenges towards cutting-plane selection ⋮ Strengthening convex relaxations of 0/1-sets using Boolean formulas ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank
This page was built for publication: Improving Integrality Gaps via Chvátal-Gomory Rounding
