On the polyhedrality of cross and quadrilateral closures
From MaRDI portal
Publication:344941
Recommendations
Cites work
- A Solution of the "Plank Problem"
- 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
- Chvátal closures for mixed integer programming problems
- Cook, Kannan and Schrijver's example revisited
- Inequalities from Two Rows of a Simplex Tableau
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- MIR closures of polyhedral sets
- Maximal lattice-free polyhedra: finiteness and an explicit description in dimension three
- On Cutting Planes
- On convergence in mixed integer programming
- On finitely generated closures in the theory of cutting planes
- On the Chvátal-Gomory closure of a compact convex set
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs
- On the relative strength of split, triangle and quadrilateral cuts
- Split closure and intersection cuts
- The Gomory-Chvátal closure of a nonrational polytope is a rational polytope
- The split closure of a strictly convex body
- 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
(17)- On the polyhedrality of closures of multibranch split sets and other polyhedra with bounded max-facet-width
- Lattice closures of polyhedra
- UB-matrices and conditions for Poncelet polygon to be closed
- On a generalization of the Chvátal-Gomory closure
- The aggregation closure is polyhedral for packing and covering integer programs
- Two-halfspace closure
- scientific article; zbMATH DE number 2196453 (Why is no real title available?)
- A constructive characterization of the split closure of a mixed integer linear program
- The triangle closure is a polyhedron
- On some generalizations of the split closure
- Partial hyperplane activation for generalized intersection cuts
- On the relative strength of different generalizations of split cuts
- Split rank of triangle and quadrilateral inequalities
- Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
- Integer packing sets form a well-quasi-ordering
- Closure constraints for hyperbolic tetrahedra
- A note on the MIR closure and basic relaxations of polyhedra
This page was built for publication: On the polyhedrality of cross and quadrilateral closures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344941)
