Bounds on the Chvatal rank of polytopes in the 0/1-cube
From MaRDI portal
Publication:1416165
DOI10.1007/s00493-003-0020-5zbMath1027.52005OpenAlexW2099246938MaRDI QIDQ1416165
Friedrich Eisenbrand, Andreas S. Schulz
Publication date: 14 December 2003
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00493-003-0020-5
Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
Related Items (17)
Small Chvátal rank ⋮ On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank ⋮ Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank ⋮ Reverse split rank ⋮ Complexity of optimizing over the integers ⋮ Complexity of branch-and-bound and cutting planes in mixed-integer optimization ⋮ Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube ⋮ Unification of lower-bound analyses of the lift-and-project rank of combinatorial optimization polyhedra ⋮ Design and Verify: A New Scheme for Generating Cutting-Planes ⋮ Design and verify: a new scheme for generating cutting-planes ⋮ Cutting Planes and the Parameter Cutwidth ⋮ Cutting planes and the parameter cutwidth ⋮ A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set ⋮ 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: Bounds on the Chvatal rank of polytopes in the 0/1-cube
