Embedding {0, ½}-Cuts in a Branch-and-Cut Framework: A Computational Study

Authors:
Giuseppe Andreello;Alberto Caprara;Matteo Fischetti
Affiliations:
DEI, Università di Padova, Via Gradenigo, 6/A, I-35131 Padova, Italy;DEIS, Università di Bologna, Viale Risorgimento, 2, I-40136 Bologna, Italy;DEI, Università di Padova, Via Gradenigo, 6/A, I-35131 Padova, Italy
Venue:
INFORMS Journal on Computing
Year:
2007

Citing 0
Cited 6

Constraint integer programming: a new approach to integrate CP and MIP

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
On counting lattice points and Chvátal-Gomory cutting planes

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Improving cutting plane generation with 0-1 inequalities by bi-criteria separation

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
BDDs in a branch and cut framework

WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A relax-and-cut framework for gomory's mixed-integer cuts

CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Approximating the Split Closure

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Embedding cuts into a branch-and-cut framework is a delicate task, especially when a large set of cuts is available. In this paper we describe a separation heuristic for {0, ½} cuts, a special case of Chvátal-Gomory cuts, that tends to produce many violated inequalities within relatively short time. We report computational results on a large testbed of integer linear programming (ILP) instances of combinatorial problems including satisfiability, max-satisfiability, and linear ordering problems, showing that a careful cut-selection strategy produces a considerable speedup with respect to the cases in which either the separation heuristic is not used at all, or all of the cuts it produces are added to the LP relaxation.