Minimal Inequalities for an Infinite Relaxation of Integer Programs

DOI10.1137/090756375zbMath1211.90139arXiv1701.06540OpenAlexW2169739053MaRDI 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

zbMATH Keywords

integer programmingcutting planesmaximal lattice-free convex sets

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mixed integer programming (90C11)

Related Items (29)

Intersection cuts for single row corner relaxations ⋮ Maximal Quadratic-Free Sets ⋮ Operations that Preserve the Covering Property of the Lifting Region ⋮ On sublinear inequalities for mixed integer conic programs ⋮ Intersection Disjunctions for Reverse Convex Sets ⋮ Computational Experiments with Cross and Crooked Cross Cuts ⋮ Unique lifting of integer variables in minimal inequalities ⋮ Towards a characterization of maximal quadratic-free sets ⋮ Outer-product-free sets for polynomial optimization and oracle-based cuts ⋮ On the Practical Strength of Two-Row Tableau Cuts ⋮ Composite lifting of group inequalities and an application to two-row mixing inequalities ⋮ Strengthening lattice-free cuts using non-negativity ⋮ An algorithm for the separation of two-row cuts ⋮ Nonunique Lifting of Integer Variables in Minimal Inequalities ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Approximation of Corner Polyhedra with Families of Intersection Cuts ⋮ Sufficiency of cut-generating functions ⋮ Intersection cuts -- standard versus restricted ⋮ Relaxations of mixed integer sets from lattice-free polyhedra ⋮ Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra ⋮ The strength of multi-row models ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ On the implementation and strengthening of intersection cuts for QCQPs ⋮ Maximal $S$-Free Convex Sets and the Helly Number ⋮ Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case ⋮ Cut-Generating Functions and S-Free Sets ⋮ A geometric approach to cut-generating functions ⋮ Maximal quadratic-free sets ⋮ Light on the infinite group relaxation. I: Foundations and taxonomy

This page was built for publication: Minimal Inequalities for an Infinite Relaxation of Integer Programs