On the polyhedrality of cross and quadrilateral closures
From MaRDI portal
Publication:344941
DOI10.1007/s10107-016-0982-xzbMath1366.90142OpenAlexW2183417495MaRDI QIDQ344941
Diego A. Morán R., Sanjeeb Dash, Oktay Günlük
Publication date: 25 November 2016
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-016-0982-x
Related Items
Integer packing sets form a well-quasi-ordering, Partial hyperplane activation for generalized intersection cuts, Lattice closures of polyhedra, Two-halfspace closure, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, On a generalization of the Chvátal-Gomory closure
Cites Work
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- On the relative strength of split, triangle and quadrilateral 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
- Cook, Kannan and Schrijver's example revisited
- Split closure and intersection cuts
- On finitely generated closures in the theory of cutting planes
- The triangle closure is a polyhedron
- On the Chvátal-Gomory closure of a compact convex set
- The split closure of a strictly convex body
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
- Two row mixed-integer cuts via lifting
- A constructive characterization of the split closure of a mixed integer linear program
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
- On Cutting Planes
- The Gomory-Chvátal Closure of a Nonrational Polytope Is a Rational Polytope
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- A Solution of the "Plank Problem"
