Pages that link to "Item:Q2248744"
From MaRDI portal
The following pages link to The triangle closure is a polyhedron (Q2248744):
Displaying 11 items.
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- Minimal cut-generating functions are nearly extreme (Q1801006) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Constructing lattice-free gradient polyhedra in dimension two (Q2118128) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets (Q3169091) (← links)
- The Chvátal-Gomory Closure of an Ellipsoid Is a Polyhedron (Q3569828) (← links)
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width (Q4976155) (← links)
- Split Cuts in the Plane (Q5147031) (← links)