Integer and combinatorial optimization
Integer and combinatorial optimization
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming: Series A and B
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
Management Science
Cutting planes in integer and mixed integer programming
Discrete Applied Mathematics
Optimizing over the first Chvátal closure
Mathematical Programming: Series A and B
Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study
INFORMS Journal on Computing
Can pure cutting plane algorithms work?
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
| Hi-index | 0.00 |
In cutting plane-based methods, the question of how to generate the “best possible” cuts is a central and critical issue. We propose a bi-criteria separation problem for generating valid inequalities that simultaneously maximizes the cut violation and a measure of the diversity between the new cut and the previously generated cut(s). We focus on problems with cuts having 0-1 coefficients, and use the 1-norm as diversity measure. In this context, the bi-criteria separation amounts to solving the standard single-criterion separation problem (maximizing violation) with different coefficients in the objective function. We assess the impact of this general approach on two challenging combinatorial optimization problems, namely the Min Steiner Tree problem and the Max Clique problem. Computational experiments show that the cuts generated by the bi-criteria separation are much stronger than those obtained by just maximizing the cut violation, and allow to close a larger fraction of the gap in a smaller amount of time.