On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width

DOI10.1137/16M1087783zbMath1373.90081OpenAlexW2734870949MaRDI QIDQ4976155

Diego A. Morán R., Oktay Günlük, Sanjeeb Dash

Publication date: 27 July 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/16m1087783

zbMATH Keywords

integer programmingcutting planesclosurepolyhedrality

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Integer packing sets form a well-quasi-ordering ⋮ Lattice closures of polyhedra ⋮ Two-halfspace closure ⋮ Generalized Chvátal-Gomory closures for integer programs with bounds on variables ⋮ On a generalization of the Chvátal-Gomory closure

Cites Work

• Unnamed Item
• Unnamed Item
• On the polyhedrality of cross and quadrilateral closures
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• 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
• Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
• Two row mixed-integer cuts via lifting
• An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
• Convex Analysis
• A Solution of the "Plank Problem"
• Ordering by Divisibility in Abstract Algebras