Bibliographic reference:
A. LODI, G. PESANT, L.-M. ROUSSEAU. On counting lattice points and Chvátal-Gomory cutting planes. CPAIOR. LNCS 6697, 131-136. 2011.
Summary:
The paper investigates the relationship between counting the lattice points belonging to an
hyperplane and the separation of Chvatal-Gomory cutting planes. In particular, we show that
counting can be exploited in two ways: (i) to strengthen the cuts separated, e.g., by the
classical procedure of Gomory, and (ii) to heuristically evaluate the effectiveness of those
cuts and possibly selecting only a subset of them. Empirical results on 0-1 Integer Programming instances are presented.
Bibtex:
@inproceedings{DBLP:conf/cpaior/LodiPR11,
author = {Andrea Lodi and
Gilles Pesant and
Louis-Martin Rousseau},
title = {On Counting Lattice Points and Chv{\'a}tal-Gomory Cutting
Planes},
booktitle = {CPAIOR},
year = {2011},
pages = {131-136},
ee = {http://dx.doi.org/10.1007/978-3-642-21311-3_13},
crossref = {DBLP:conf/cpaior/2011},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/cpaior/2011,
editor = {Tobias Achterberg and
J. Christopher Beck},
title = {Integration of AI and OR Techniques in Constraint Programming
for Combinatorial Optimization Problems - 8th International
Conference, CPAIOR 2011, Berlin, Germany, May 23-27, 2011.
Proceedings},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {6697},
year = {2011},
isbn = {978-3-642-21310-6},
ee = {http://dx.doi.org/10.1007/978-3-642-21311-3},
bibsource = {DBLP, http://dblp.uni-trier.de}
}