Cutting Planes and the Parameter Cutwidth

DOI10.1007/978-3-642-03073-4_15zbMath1268.03080OpenAlexW1757999128MaRDI QIDQ3576046

Barnaby Martin, Stefan S. Dantchev

Publication date: 28 July 2010

Published in: Mathematical Theory and Computational Practice (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03073-4_15

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Complexity of proofs (03F20)

Related Items (2)

Rank complexity gap for Lovász-Schrijver and Sherali-Adams proof systems ⋮ Cutting planes and the parameter cutwidth

Cites Work

• 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
• Edmonds polytopes and a hierarchy of combinatorial problems
• Short proofs are narrow—resolution made simple
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cutting Planes and the Parameter Cutwidth