On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
From MaRDI portal
Publication:4976155
Recommendations
Cites work
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 4119933 (Why is no real title available?)
- A Solution of the "Plank Problem"
- An analysis of mixed integer linear sets based on lattice point free convex sets
- Chvátal closures for mixed integer programming problems
- Convex Analysis
- Cook, Kannan and Schrijver's example revisited
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming
- On finitely generated closures in the theory of cutting planes
- On the polyhedrality of cross and quadrilateral closures
- Ordering by Divisibility in Abstract Algebras
- Split closure and intersection cuts
- The triangle closure is a polyhedron
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Two row mixed-integer cuts via lifting
Cited in
(7)- Lattice closures of polyhedra
- On a generalization of the Chvátal-Gomory closure
- Two-halfspace closure
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube
- Integer packing sets form a well-quasi-ordering
- A note on the MIR closure and basic relaxations of polyhedra
This page was built for publication: On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4976155)
