Maximal Lattice-Free Convex Sets in Linear Subspaces
From MaRDI portal
Publication:3169114
DOI10.1287/moor.1100.0461zbMath1218.90130arXiv1701.06543MaRDI QIDQ3169114
Cornuéjols, Gérard, Giacomo Zambelli, Amitabh Basu, Michele Conforti
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/1701.06543
integer programming; geometry of numbers; maximal lattice-free convex sets; minimal valid inequalities
52B12: Special polytopes (linear programming, centrally symmetric, etc.)
90C10: Integer programming
90C11: Mixed integer programming
52A20: Convex sets in (n) dimensions (including convex hypersurfaces)
Related Items
Approximation of Corner Polyhedra with Families of Intersection Cuts, Maximal Quadratic-Free Sets, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Mixed-Integer Convex Representability, Multirow Intersection Cuts Based on the Infinity Norm, Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions—Modeling Implications, On Subadditive Duality for Conic Mixed-integer Programs, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Cut-Generating Functions and S-Free Sets, Relaxations of mixed integer sets from lattice-free polyhedra, Relaxations of mixed integer sets from lattice-free polyhedra, On the implementation and strengthening of intersection cuts for QCQPs, On the implementation and strengthening of intersection cuts for QCQPs, Towards a characterization of maximal quadratic-free sets, Light on the infinite group relaxation. I: Foundations and taxonomy, Some properties of convex hulls of integer points contained in general convex sets, Unique lifting of integer variables in minimal inequalities, Equivariant perturbation in Gomory and Johnson's infinite group problem. III: Foundations for the \(k\)-dimensional case with applications to \(k=2\), Inequalities for the lattice width of lattice-free convex sets in the plane, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Lifting properties of maximal lattice-free polyhedra, Reverse split rank, Theoretical challenges towards cutting-plane selection, Some cut-generating functions for second-order conic sets, Intersection cuts for convex mixed integer programs from translated cones, Minimal cut-generating functions are nearly extreme, On finitely generated closures in the theory of cutting planes, A proof of Lovász's theorem on maximal lattice-free sets, A local maximizer for lattice width of 3-dimensional hollow bodies, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets, Constructing lattice-free gradient polyhedra in dimension two, Complexity of linear relaxations in integer programming, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Lattice closures of polyhedra, Outer-product-free sets for polynomial optimization and oracle-based cuts, The triangle closure is a polyhedron, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, An extremal property of lattice polygons, A geometric approach to cut-generating functions, Tight bounds on discrete quantitative Helly numbers, The structure of the infinite models in integer programming, Maximal $S$-Free Convex Sets and the Helly Number, On the Practical Strength of Two-Row Tableau Cuts, Helly’s theorem: New variations and applications, When Lift-and-Project Cuts Are Different, Closedness of Integer Hulls of Simple Conic Sets
