Pages that link to "Item:Q3169091"
From MaRDI portal
The following pages link to An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets (Q3169091):
Displaying 21 items.
- On the polyhedrality of cross and quadrilateral closures (Q344941) (← links)
- Split cuts for robust mixed-integer optimization (Q439905) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- A quantitative Doignon-Bell-Scarf theorem (Q1743170) (← links)
- On finitely generated closures in the theory of cutting planes (Q1926485) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- Maximal quadratic-free sets (Q2118125) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- Outer-product-free sets for polynomial optimization and oracle-based cuts (Q2196293) (← links)
- The triangle closure is a polyhedron (Q2248744) (← links)
- Disjunctive programming and relaxations of polyhedra (Q2452382) (← links)
- Integer packing sets form a well-quasi-ordering (Q2661623) (← links)
- On the Practical Strength of Two-Row Tableau Cuts (Q2962551) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width (Q4976155) (← links)
- Maximal Quadratic-Free Sets (Q5041754) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5894789) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5918425) (← links)
- Relaxations of mixed integer sets from lattice-free polyhedra (Q5925161) (← links)
- On the implementation and strengthening of intersection cuts for QCQPs (Q5925638) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
