On counting lattice points and Chvátal-Gomory cutting planes

DOI10.1007/978-3-642-21311-3_13zbMATH Open1302.90257OpenAlexW2007666940MaRDI QIDQ3003282FDOQ3003282

Authors: Andrea Lodi, Gilles Pesant, Louis-Martin Rousseau 

Publication date: 26 May 2011

Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-21311-3_13

Recommendations

• Iterated Chvátal-Gomory cuts and the geometry of numbers
• On the enumerative nature of Gomory's dual cutting plane method
• Chvátal closures for mixed integer programming problems
• Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
• \(\{ 0,\frac12\}\)-Chvátal-Gomory cuts

zbMATH Keywords

cutting planescut selectionCounting lattice points

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10) Boolean programming (90C09)

Cited In (2)

• Cutting plane selection with analytic centers and multiregression
• Theoretical challenges towards cutting-plane selection

This page was built for publication: On counting lattice points and Chvátal-Gomory cutting planes

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