Small Chvátal rank

DOI10.1007/s10107-010-0370-xzbMath1198.90295arXiv0705.1027OpenAlexW2071879725MaRDI QIDQ2638380

Annie Raymond, Rekha R. Thomas, Tristram C. Bogart

Publication date: 16 September 2010

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

Full work available at URL: https://arxiv.org/abs/0705.1027

zbMATH Keywords

integer programmingcutting planesChvátal rankstable set polytopessupernormality

Mathematics Subject Classification ID

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

Related Items

The power of pyramid decomposition in Normaliz, Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube

Uses Software

• Normaliz

Cites Work

• Unnamed Item
• Supernormal vector configurations
• Decomposition of regular matroids
• On stable set polyhedra for K//(1,3)free graphs
• Geometric algorithms and combinatorial optimization.
• The rank facets of the stable set polytope for claw-free graphs
• Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
• Bounds on the Chvatal rank of polytopes in the 0/1-cube
• The toric Hilbert scheme of a rank two lattice is smooth and irreducible.
• Facets with fixed defect of the stable set polytope
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs
• A lift-and-project cutting plane algorithm for mixed 0-1 programs
• Edmonds polytopes and a hierarchy of combinatorial problems
• On a Representation of the Matching Polytope Via Semidefinite Liftings
• A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
• Cones of Matrices and Set-Functions and 0–1 Optimization
• Short rational generating functions for lattice point problems