Inequalities from Two Rows of a Simplex Tableau

Authors:
Kent Andersen;Quentin Louveaux;Robert Weismantel;Laurence A. Wolsey
Affiliations:
Institute for Mathematical Sciences, University of Copenhagen, Denmark;CORE and INMA, Université catholique de Louvain, Belgium;Department of Mathematics, Otto-von-Guericke Universität, Magdeburg, Germany;CORE and INMA, Université catholique de Louvain, Belgium
Venue:
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Year:
2007

Citing 3
Cited 21

Theory of linear and integer programming

Theory of linear and integer programming
Integer and combinatorial optimization

Integer and combinatorial optimization
Chva´tal closures for mixed integer programming problems

Mathematical Programming: Series A and B

Minimal Inequalities for an Infinite Relaxation of Integer Programs

SIAM Journal on Discrete Mathematics
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs

Operations Research
A probabilistic analysis of the strength of the split and triangle closures

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Lifted Tableaux Inequalities for 0--1 Mixed-Integer Programs: A Computational Study

INFORMS Journal on Computing
Split Rank of Triangle and Quadrilateral Inequalities

Mathematics of Operations Research
Experiments with Two-Row Cuts from Degenerate Tableaux

INFORMS Journal on Computing
Maximal Lattice-Free Polyhedra: Finiteness and an Explicit Description in Dimension Three

Mathematics of Operations Research
Constrained Infinite Group Relaxations of MIPs

SIAM Journal on Optimization
On Maximal $S$-Free Convex Sets

SIAM Journal on Discrete Mathematics
Intersection Cuts with Infinite Split Rank

Mathematics of Operations Research
Zero-Coefficient cuts

IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
On lifting integer variables in minimal inequalities

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
A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts

Operations Research Letters
Computing with multi-row Gomory cuts

Operations Research Letters
Stable sets, corner polyhedra and the Chvátal closure

Operations Research Letters
Strengthening lattice-free cuts using non-negativity

Discrete Optimization
Cook, Kannan and Schrijver's example revisited

Discrete Optimization
Composite lifting of group inequalities and an application to two-row mixing inequalities

Discrete Optimization
Cut-Generating functions

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
On some generalizations of the split closure

IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we explore the geometry of the integer points in a cone rooted at a rational point. This basic geometric object allows us to establish some links between lattice point free bodies and the derivation of inequalities for mixed integer linear programs by considering two rows of a simplex tableau simultaneously.