Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study

Authors:
Amar K. Narisetty;Jean-Philippe P. Richard;George L. Nemhauser
Affiliations:
School of Industrial Engineering, Purdue University, West Lafayette, Indiana 47907;Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611;School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia 30332
Venue:
INFORMS Journal on Computing
Year:
2011

Citing 11
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
MIP: Theory and Practice - Closing the Gap

Proceedings of the 19th IFIP TC7 Conference on System Modelling and Optimization: Methods, Theory and Applications
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

INFORMS Journal on Computing
Cutting planes in integer and mixed integer programming

Discrete Applied Mathematics
A simplex-based algorithm for 0-1 mixed integer programming

Combinatorial optimization - Eureka, you shrink!
Inequalities from Two Rows of a Simplex Tableau

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Valid inequalities for MIPs and group polyhedra from approximate liftings

Mathematical Programming: Series A and B
On the facets of mixed integer programs with two integer variables and two constraints

Mathematical Programming: Series A and B
Lifting integer variables in minimal inequalities corresponding to lattice-free triangles

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
MIPLIB 2003

Operations Research Letters
Gomory cuts revisited

Operations Research Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe families of inequalities for 0--1 mixed-integer programming problems that are obtained by lifting cover and packing inequalities. We show that these inequalities can be separated from single rows of the simplex tableaux of their linear programming relaxations. We present the results of a computational study comparing their performance with that of Gomory mixed-integer cuts on a collection of MIPLIB and randomly generated 0--1 mixed-integer programs. The computational study shows that these cuts yield better results than Gomory mixed-integer cuts.