On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank

DOI10.1007/s10107-017-1226-4zbMath1414.90231OpenAlexW2791467357MaRDI QIDQ1801017

Dabeen Lee, Cornuéjols, Gérard

Publication date: 26 October 2018

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-017-1226-4

zbMATH Keywords

polyhedral decompositionunit hypercubeChvátal rank

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

Achieving consistency with cutting planes, Sparsity of integer formulations for binary programs

Cites Work

• Unnamed Item
• Unnamed Item
• Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank
• 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
• Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point
• Outline of an algorithm for integer solutions to linear programs
• On Cutting Planes
• 0/1 Polytopes with Quadratic Chvátal Rank
• The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
• Ideal Clutters That Do Not Pack
• Forbidden Vertices
• On the rank of mixed 0,1 polyhedra.