A connection between cutting plane theory and the geometry of numbers

DOI10.1007/S10107-002-0302-5MaRDI QIDQ1849263zbMATH OpenOpenAlexFDO

Authors Yanjun Li, Gérard Cornuéjols

Publication date 1 December 2002

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

Full work available at URL https://figshare.com/articles/journal_contribution/A_Connection_between_Cutting_Plane_Theory_and_the_Geometry_of_Numbers/6702863

zbMATH Keywords

closest vector problemsplit cutmembership problemvalidity problemGomory cutdominance problemdisjunctive cutChvátal cut

Mathematics Subject Classification ID

Integer programming (90C10) Geometry of numbers (11H99)

Recommendations

• Iterated Chvátal-Gomory cuts and the geometry of numbers
• On the complexity of cutting-plane proofs
• On cutting-plane proofs in combinatorial optimization
• On the complexity of cutting-plane proofs using split cuts
• Cutting Planes and the Elementary Closure in Fixed Dimension

Cited in

(6)

• On the membership problem for the \({0, 1/2}\)-closure
• Valid inequalities for mixed integer linear programs
• Cutting planes from a mixed integer Farkas lemma.
• Approximate fixed-rank closures of covering problems
• Cook, Kannan and Schrijver's example revisited
• Projected Chvátal-Gomory cuts for mixed integer linear programs

This page was built for publication: A connection between cutting plane theory and the geometry of numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849263)