Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube

DOI10.1016/j.orl.2011.03.001zbMath1219.90106OpenAlexW2002423337MaRDI QIDQ635513

Sebastian Pokutta, Gautier Stauffer

Publication date: 19 August 2011

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.03.001

zbMATH Keywords

Chvàtal-gomory procedurecutting-plane proceduresrank lower bounds

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05)

Related Items

Theoretical challenges towards cutting-plane selection ⋮ Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank ⋮ Reverse split rank ⋮ Algorithms for highly symmetric linear and integer programs ⋮ Generalized Chvátal-Gomory closures for integer programs with bounds on variables ⋮ Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs ⋮ Design and verify: a new scheme for generating cutting-planes ⋮ Aggregation-based cutting-planes for packing and covering integer programs ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Edmonds polytopes and a hierarchy of combinatorial problems
• Small Chvátal rank
• Matroid matching
• Outline of an algorithm for integer solutions to linear programs
• On Cutting Planes