• Corpus ID: 15284752

Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets

@article{Basu2011AlgorithmicAC,
  title={Algorithmic and Complexity Results for Cutting Planes Derived from Maximal Lattice-Free Convex Sets},
  author={Amitabh Basu and Robert Hildebrand and Matthias K{\"o}ppe},
  journal={ArXiv},
  year={2011},
  volume={abs/1107.5068}
}
We study a mixed integer linear program with m integer variables and k nonnegative continuous variables in the form of the relaxation of the corner polyhedron that was introduced by Andersen, Louveaux, Weismantel and Wolsey [Inequalities from two rows of a simplex tableau, Proc. IPCO 2007, LNCS, vol. 4513, Springer, pp. 1{15]. We describe the facets of this mixed integer linear program via the extreme points of a well-dened polyhedron. We then utilize this description to give polynomial time… 
View PDF on arXiv
8 Citations
Highly Influential Citations
2
Background Citations
3
Methods Citations
2

8 Citations

The triangle closure is a polyhedron

It is shown that when the number of integer variables $$m=2$$ the triangle closure is indeed a polyhedron and its number of facets can be bounded by a polynomial in the size of the input data.

Intersection cuts for single row corner relaxations

An algorithm for enumerating all the maximal Z×Z+-free sets corresponding to facet-defining inequalities, and an upper bound on the split rank of those inequalities is provided.

Relaxations of mixed integer sets from lattice-free polyhedra

An introduction to a recently established link between the geometry of numbers and mixed integer optimization and a review of families of lattice-free polyhedra and their use in a disjunctive programming approach is given.

Relaxations of mixed integer sets from lattice-free polyhedra

This paper gives an introduction to a recently established link between the geometry of numbers and mixed integer optimization. The main focus is to provide a review of families of lattice-free…

Computing with Multi-Row Intersection Cuts

A small subset of multi-row intersection cuts based on the infinity norm, which works for relaxations with arbitrary numbers of rows, and is concluded that these cuts yield benefits comparable to using the entire class ofmulti-row cuts, but at a small fraction of the computational cost.

Valid inequalities for mixed-integer linear programming problems

A new family of superadditive valid inequalities that are obtained from value functions of special surrogate optimization problems of Mixed-integer Linear Programming (MILP) problems are proposed.

On the Practical Strength of Two-Row Tableau Cuts

Some insight is gained into key characteristics of MIP instances whose presence makes two-row triangle cuts computationally effective, and it appears to be necessary that the tableau row pairs are dense, and more subjectively that the nonbasic continuous variables are ``important".

Relaxations of mixed integer sets from lattice-free polyhedra

An introduction to a recently established link between the geometry of numbers and mixed integer optimization and a review of families of lattice-free polyhedra and their use in a disjunctive programming approach is given.

References

SHOWING 1-10 OF 19 REFERENCES

Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles

This paper analyzes the lifting of minimal inequalities derived from lattice-free triangles and proves that the lifting functions are unique for each of the first two categories such that the resultant inequality is minimal for the mixed integer infinite group problem, and shows that it is not necessarily unique in the third category.

Intersection Cuts - A New Type of Cutting Planes for Integer Programming

The paper gives a simple formula for finding the equation of the hyperplane, discusses some ways of strengthening the cut, proposes an algorithm, and gives a finiteness proof.

On integer points in polyhedra

An algorithm which determines the number of integer points in a polyhedron to within a multiplicative factor of 1+ε in time polynomial inm, ϕ and 1/ε when the dimensionn is fixed is described.

Corner Polyhedron and Intersection Cuts

On the facets of mixed integer programs with two integer variables and two constraints

In this paper we consider an infinite relaxation of the mixed integer linear program with two integer variables, nonnegative continuous variables and two equality constraints, and we give a complete…

Maximal Lattice-Free Convex Sets in Linear Subspaces

A model that arises in integer programming is considered and it is shown that all irredundant inequalities are obtained from maximal lattice-free convex sets in an affine subspace and that these sets are polyhedra.

Inequalities from Two Rows of a Simplex Tableau

The geometry of the integer points in a cone rooted at a rational point allows 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.

On the continuity of the maximum in parametric linear programming

For the widest class of parametric linear programs with continuous dependence of coefficients on parameters, the following theorem is proven: for any parameter vectort0 in the domain of definition of…

Optimal search for rationals

Some polyhedra related to combinatorial problems