Approximating the Split Closure

Authors:
Matteo Fischetti;Domenico Salvagnin
Affiliations:
Department of Information Engineering, University of Padova, 6/B 35131 Padova, Italy;Department of Information Engineering, University of Padova, 6/B 35131 Padova, Italy
Venue:
INFORMS Journal on Computing
Year:
2013

Citing 16
Cited 0

A recursive procedure to generate all cuts for 0-1 mixed integer programs

Mathematical Programming: Series A and B
Chva´tal closures for mixed integer programming problems

Mathematical Programming: Series A and B
Mixed 0-1 programming by lift-and-project in a branch-and-cut framework

Management Science
MIP: Theory and Practice - Closing the Gap

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
Aggregation and Mixed Integer Rounding to Solve MIPs

Operations Research
Split closure and intersection cuts

Mathematical Programming: Series A and B
Optimizing over the first Chvátal closure

Mathematical Programming: Series A and B
Optimizing over the split closure

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

INFORMS Journal on Computing
Solving Hard Mixed-Integer Programming Problems with Xpress-MP: A MIPLIB 2003 Case Study

INFORMS Journal on Computing
MIR closures of polyhedral sets

Mathematical Programming: Series A and B
On the separation of disjunctive cuts

Mathematical Programming: Series A and B
Zero-Coefficient cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
Experiments with two row tableau cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
MIPLIB 2003

Operations Research Letters
A note on the MIR closure and basic relaxations of polyhedra

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

The split closure has been proved in practice to be a very tight approximation of the integer hull formulation of a generic mixed-integer linear program. However, exact separation procedures for optimizing over the split closure have unacceptable computing times in practice; hence, many different heuristic strategies have been proposed in the last few years. In this paper we present a new overall framework for approximating the split closure that merges different ideas from the previous approaches. Computational results prove the effectiveness of the proposed procedure compared to the state of the art, showing that a good approximation of the split closure bound can be obtained with very reasonable computing times.