0/1 Polytopes with Quadratic Chvátal Rank
From MaRDI portal
Publication:4911536
DOI10.1007/978-3-642-36694-9_30zbMath1377.90112arXiv1204.4753OpenAlexW1862363755MaRDI QIDQ4911536
Publication date: 19 March 2013
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4753
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (9)
On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank ⋮ Reverse split rank ⋮ Complexity of optimizing over the integers ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank ⋮ Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II ⋮ High Degree Sum of Squares Proofs, Bienstock--Zuckerberg Hierarchy, and Chvátal--Gomory Cuts
This page was built for publication: 0/1 Polytopes with Quadratic Chvátal Rank
