An Analysis of Mixed Integer Linear Sets Based on Lattice Point Free Convex Sets
From MaRDI portal
Publication:3169091
DOI10.1287/moor.1090.0439zbMath1220.90070arXiv0906.5212OpenAlexW2147382371MaRDI QIDQ3169091
Robert Weismantel, Quentin Louveaux, Kent Andersen
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.5212
Related Items
Maximal Quadratic-Free Sets, On the polyhedrality of cross and quadrilateral closures, Integer packing sets form a well-quasi-ordering, On finitely generated closures in the theory of cutting planes, Lattice closures of polyhedra, Outer-product-free sets for polynomial optimization and oracle-based cuts, On the Practical Strength of Two-Row Tableau Cuts, Split cuts for robust mixed-integer optimization, Helly’s theorem: New variations and applications, Disjunctive programming and relaxations of polyhedra, Relaxations of mixed integer sets from lattice-free polyhedra, A quantitative Doignon-Bell-Scarf theorem, The triangle closure is a polyhedron, Relaxations of mixed integer sets from lattice-free polyhedra, On convergence in mixed integer programming, Intersection cuts for nonlinear integer programming: convexification techniques for structured sets, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets
