Minimal Inequalities for an Infinite Relaxation of Integer Programs
From MaRDI portal
Publication:3084218
DOI10.1137/090756375zbMath1211.90139arXiv1701.06540MaRDI QIDQ3084218
Giacomo Zambelli, Michele Conforti, Cornuéjols, Gérard, Amitabh Basu
Publication date: 15 March 2011
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1701.06540
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
90C11: Mixed integer programming
Related Items
Approximation of Corner Polyhedra with Families of Intersection Cuts, Maximal Quadratic-Free Sets, Intersection Disjunctions for Reverse Convex Sets, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Cut-Generating Functions and S-Free Sets, Nonunique Lifting of Integer Variables in Minimal Inequalities, 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, On sublinear inequalities for mixed integer conic programs, Unique lifting of integer variables in minimal inequalities, Composite lifting of group inequalities and an application to two-row mixing inequalities, Strengthening lattice-free cuts using non-negativity, Sufficiency of cut-generating functions, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Intersection cuts for single row corner relaxations, Intersection cuts -- standard versus restricted, Maximal quadratic-free sets, Outer-product-free sets for polynomial optimization and oracle-based cuts, A geometric approach to cut-generating functions, An algorithm for the separation of two-row cuts, The strength of multi-row models, Maximal $S$-Free Convex Sets and the Helly Number, Computational Experiments with Cross and Crooked Cross Cuts, On the Practical Strength of Two-Row Tableau Cuts, Operations that Preserve the Covering Property of the Lifting Region
