The following pages link to Lattice closures of polyhedra (Q2188243):
Displaying 9 items.
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- Cook, Kannan and Schrijver's example revisited (Q955332) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets (Q3169091) (← links)
- Closure constraints for hyperbolic tetrahedra (Q3447536) (← links)
- On polytopes with linear rank with respect to generalizations of the split closure (Q6122082) (← links)