On Counting Lattice Points and Chvátal-Gomory Cutting Planes
From MaRDI portal
Publication:3003282
DOI10.1007/978-3-642-21311-3_13zbMath1302.90257OpenAlexW2007666940MaRDI QIDQ3003282
Gilles Pesant, Andrea Lodi, 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
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)
Related Items (2)
Theoretical challenges towards cutting-plane selection ⋮ Cutting plane selection with analytic centers and multiregression
This page was built for publication: On Counting Lattice Points and Chvátal-Gomory Cutting Planes
