Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank
From MaRDI portal
Publication:5219666
DOI10.1287/moor.2017.0880zbMath1451.90115arXiv1611.06593OpenAlexW2551359169MaRDI QIDQ5219666
Stefan Weltge, Tony Huynh, Yohann Benchetrit, Samuel Fiorini
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.06593
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Polynomial optimization (90C23)
Related Items
Cites Work
- Unnamed Item
- On cutting-plane proofs in combinatorial optimization
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- On the Chvátal-Gomory closure of a compact convex set
- Edmonds polytopes and a hierarchy of combinatorial problems
- Facet Generating Techniques
- On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank
- Integer Programming
- Reverse Chvátal--Gomory Rank
- Improving Integrality Gaps via Chvátal-Gomory Rounding
- Subset Algebra Lift Operators for 0-1 Integer Programming
- 0/1 Polytopes with Quadratic Chvátal Rank