Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
From MaRDI portal
Publication:2248762
DOI10.1007/s10107-013-0654-zzbMath1312.90045OpenAlexW2157274017MaRDI QIDQ2248762
Tomasz J. Nowicki, Sanjeeb Dash, Neil B. Dobbs, 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
Mixed integer programming (90C11) Abstract computational complexity for mathematical programming problems (90C60)
Related Items
Lattice-free simplices with lattice width \(2d - o(d)\), On \(t\)-branch split cuts for mixed-integer programs, Complexity of optimizing over the integers, Complexity of branch-and-bound and cutting planes in mixed-integer optimization, On the facet defining inequalities of the mixed-integer bilinear covering set, Relaxations of mixed integer sets from lattice-free polyhedra, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, On the relative strength of different generalizations of split cuts, Relaxations of mixed integer sets from lattice-free polyhedra, A local maximizer for lattice width of 3-dimensional hollow bodies, Hollow polytopes of large width, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, Computing the covering radius of a polytope with an application to lonely runners
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- On \(t\)-branch split cuts for mixed-integer programs
- On mixed-integer sets with two integer variables
- On convergence in mixed integer programming
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- A hierarchy of relaxations leading to the convex hull representation for general discrete optimization problems
- Blowing up convex sets in the plane
- Chvátal closures for mixed integer programming problems
- Cook, Kannan and Schrijver's example revisited
- From the Mahler conjecture to Gauss linking integrals
- Covering minima and lattice-point-free convex bodies
- New volume ratio properties for convex symmetric bodies in \({\mathbb{R}}^ n\)
- Distances between non-symmetric convex bodies and the \(MM^*\)-estimate
- Two row mixed-integer cuts via lifting
- On the Rank of Disjunctive Cuts
- Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
- 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
- Disjunctive Programming
- The Flatness Theorem for Nonsymmetric Convex Bodies via the Local Theory of Banach Spaces
- Inequalities from Two Rows of a Simplex Tableau
- A disjunctive cutting plane procedure for general mixed-integer linear programs
