Relaxations of mixed integer sets from lattice-free polyhedra
From MaRDI portal
Publication:5925161
DOI10.1007/s10479-015-2024-0zbMath1342.90110OpenAlexW2030906952WikidataQ57568087 ScholiaQ57568087MaRDI QIDQ5925161
Alberto Del Pia, Robert Weismantel
Publication date: 22 July 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/20.500.11850/51191
Related Items
Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Lattice-free simplices with lattice width \(2d - o(d)\), Difference between families of weakly and strongly maximal integral lattice-free polytopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- Unique lifting of integer variables in minimal inequalities
- On mixed-integer sets with two integer variables
- Strengthening lattice-free cuts using non-negativity
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts
- On the relative strength of split, triangle and quadrilateral cuts
- A note on the MIR closure and basic relaxations of polyhedra
- A note on the split rank of intersection cuts
- On convergence in mixed integer programming
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- MIR closures of polyhedral sets
- Chvátal closures for mixed integer programming problems
- On the complexity of cutting-plane proofs using split cuts
- Equivalence between intersection cuts and the corner polyhedron
- Disjunctive programming: Properties of the convex hull of feasible points
- On the separation of split cuts and related inequalities
- Split closure and intersection cuts
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Worst-case comparison of valid inequalities for the TSP
- On finitely generated closures in the theory of cutting planes
- Generalized intersection cuts and a new cut generating paradigm
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- Disjunctive programming and relaxations of polyhedra
- Optimizing over the split closure
- Some polyhedra related to combinatorial problems
- Edmonds polytopes and a hierarchy of combinatorial problems
- Two row mixed-integer cuts via lifting
- A constructive characterization of the split closure of a mixed integer linear program
- Split Rank of Triangle and Quadrilateral Inequalities
- Projecting Lattice Polytopes Without Interior Lattice Points
- Intersection Cuts with Infinite Split Rank
- Unique Minimal Liftings for Simplicial Polytopes
- On the Rank of Disjunctive Cuts
- Computational Experiments with Cross and Crooked Cross Cuts
- Convex Sets and Minimal Sublinear Functions
- A Probabilistic Analysis of the Strength of the Split and Triangle Closures
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- On Maximal S-Free Convex Sets
- A Geometric Perspective on Lifting
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- Maximal Lattice-Free Convex Sets in Linear Subspaces
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- Polyhedral Approaches to Mixed Integer Linear Programming
- On Lifting Integer Variables in Minimal Inequalities
- Aggregation and Mixed Integer Rounding to Solve MIPs
- Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
- On the Convergence of Sequences of Convex Sets in Finite Dimensions
- On Cutting Planes
- Polynomial algorithms in linear programming
- On the existence of optimal solutions to integer and mixed-integer programming problems
- An observation on the structure of production sets with indivisibilities
- A Theorem Concerning the Integer Lattice
- Disjunctive Programming
- Computing convex hulls with a linear solver
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Inequalities from Two Rows of a Simplex Tableau
- On the MIR Closure of Polyhedra
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Relaxations of mixed integer sets from lattice-free polyhedra
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- On the rank of mixed 0,1 polyhedra.
