Cutting planes and the parameter cutwidth
From MaRDI portal
Publication:693047
DOI10.1007/s00224-011-9373-0zbMath1282.03023OpenAlexW2022668562MaRDI QIDQ693047
Barnaby Martin, Stefan S. Dantchev
Publication date: 7 December 2012
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-011-9373-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the complexity of cutting-plane proofs
- Bounds on the Chvatal rank of polytopes in the 0/1-cube
- A complexity gap for tree resolution
- On the Chvátal rank of polytopes in the 0/1 cube
- A combinatorial characterization of resolution width
- Edmonds polytopes and a hierarchy of combinatorial problems
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Cutting Planes and the Parameter Cutwidth
- Short proofs are narrow—resolution made simple
This page was built for publication: Cutting planes and the parameter cutwidth
