On the Chvátal rank of polytopes in the 0/1 cube

DOI10.1016/S0166-218X(99)00156-0zbMath0956.52013MaRDI QIDQ1961231

Andreas S. Schulz, Alexander Bockmayr, Friedrich Eisenbrand, Mark E. Hartmann

Publication date: 4 March 2001

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationrational polyhedronintegral polytopeChvàtal-Gomory rounding procedurecomplexity of the integer hull

Mathematics Subject Classification ID

(n)-dimensional polytopes (52B11) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Computational aspects related to convexity (52B55)

Related Items

On Some Polytopes Contained in the 0,1 Hypercube that Have a Small Chvátal Rank, Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank, Complexity of optimizing over the integers, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube, Random half-integral polytopes, Cutting Planes and the Parameter Cutwidth, Cutting planes and the parameter cutwidth, A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set, On some polytopes contained in the 0,1 hypercube that have a small Chvátal rank, Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On cutting-plane proofs in combinatorial optimization
• Edmonds polytopes and a hierarchy of combinatorial problems
• Sensitivity theorems in integer linear programming
• On Cutting Planes