Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
DOI10.1007/S10107-013-0654-ZzbMATH Open1312.90045OpenAlexW2157274017MaRDI QIDQ2248762FDOQ2248762
Authors: Sanjeeb Dash, Neil Dobbs, Tomasz J. Nowicki, Grzegorz Świrszcz, Oktay Günlük 
Publication date: 27 June 2014
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-013-0654-z
Recommendations
Abstract computational complexity for mathematical programming problems (90C60) Mixed integer programming (90C11)
Cites Work
- Title not available (Why is that?)
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
- Two row mixed-integer cuts via lifting
- Integer Programming with a Fixed Number of Variables
- Maximal lattice-free convex sets in linear subspaces
- Outline of an algorithm for integer solutions to linear programs
- Inequalities from Two Rows of a Simplex Tableau
- Title not available (Why is that?)
- Title not available (Why is that?)
- Disjunctive Programming
- From the Mahler conjecture to Gauss linking integrals
- Covering minima and lattice-point-free convex bodies
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Blowing up convex sets in the plane
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- On \(t\)-branch split cuts for mixed-integer programs
- Chvátal closures for mixed integer programming problems
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- A disjunctive cutting plane procedure for general mixed-integer linear programs
- Title not available (Why is that?)
- On convergence in mixed integer programming
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Cook, Kannan and Schrijver's example revisited
- On the rank of disjunctive cuts
- On mixed-integer sets with two integer variables
Cited In (19)
- Hollow polytopes of large width
- On the facet defining inequalities of the mixed-integer bilinear covering set
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs
- A local maximizer for lattice width of 3-dimensional hollow bodies
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization
- Lattice-free simplices with lattice width \(2d - o(d)\)
- On \(t\)-branch split cuts for mixed-integer programs
- On an analysis of the strength of mixed-integer cutting planes from multiple simplex tableau rows
- Two row mixed-integer cuts via lifting
- On the rank of disjunctive cuts
- Relaxations of mixed integer sets from lattice-free polyhedra
- Relaxations of mixed integer sets from lattice-free polyhedra
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- On the complexity of selecting disjunctions in integer programming
- Complexity of optimizing over the integers
- On the relative strength of different generalizations of split cuts
- On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
- An analysis of mixed integer linear sets based on lattice point free convex sets
- Computing the covering radius of a polytope with an application to lonely runners
This page was built for publication: Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2248762)
