Pages that link to "Item:Q1926485"
From MaRDI portal
The following pages link to On finitely generated closures in the theory of cutting planes (Q1926485):
Displaying 15 items.
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- Lifting properties of maximal lattice-free polyhedra (Q896280) (← links)
- Cutting planes from a mixed integer Farkas lemma. (Q1426721) (← 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)
- Lattice closures of polyhedra (Q2188243) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- Integer packing sets form a well-quasi-ordering (Q2661623) (← links)
- Generalized flatness constants, spanning lattice polytopes, and the Gromov width (Q2686594) (← links)
- Two-halfspace closure (Q2689824) (← links)
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets (Q3169091) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← 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)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
