Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
From MaRDI portal
Publication:408442
DOI10.1016/j.orl.2011.09.004zbMath1235.90097OpenAlexW1975040408MaRDI QIDQ408442
Sebastian Pokutta, Andreas S. Schulz
Publication date: 5 April 2012
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2011.09.004
Related Items
Design and Verify: A New Scheme for Generating Cutting-Planes ⋮ Design and verify: a new scheme for generating cutting-planes ⋮ On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank
Cites Work
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube
- On cutting-plane proofs in combinatorial optimization
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- On the Chvátal rank of polytopes in the 0/1 cube
- Edmonds polytopes and a hierarchy of combinatorial problems
- Outline of an algorithm for integer solutions to linear programs
- On the Rank of Cutting-Plane Proof Systems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
