On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank

DOI10.1007/978-3-319-33461-5_25zbMath1419.90092OpenAlexW2476232195MaRDI QIDQ3186511

Cornuéjols, Gérard, Dabeen Lee

Publication date: 10 August 2016

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-33461-5_25

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Strengthening convex relaxations of 0/1-sets using Boolean formulas, On the rational polytopes with Chvátal rank 1, Ideal Clutters That Do Not Pack, Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank, Testing idealness in the filter oracle model

Cites Work

• Unnamed Item
• 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
• On the Chvátal-Gomory closure of a compact convex set
• Edmonds polytopes and a hierarchy of combinatorial problems
• Delta Minors, Delta Free Clutters, and Entanglement
• Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
• On Cutting Planes
• 0/1 Polytopes with Quadratic Chvátal Rank
• Forbidden Vertices