Minimal Valid Inequalities for Integer Constraints
From MaRDI portal
Publication:3169050
DOI10.1287/moor.1080.0370zbMath1218.90131MaRDI QIDQ3169050
Cornuéjols, Gérard, Valentin Borozan
Publication date: 27 April 2011
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/553bbdafc121da9454a658be480633fdf9e7aa02
52C07: Lattices and convex bodies in (n) dimensions (aspects of discrete geometry)
90C11: Mixed integer programming
11H06: Lattices and convex bodies (number-theoretic aspects)
Related Items
Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, Equivariant Perturbation in Gomory and Johnson's Infinite Group Problem. I. The One-Dimensional Case, Cut-Generating Functions and S-Free Sets, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints, On the implementation and strengthening of intersection cuts for QCQPs, 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, Strengthening lattice-free cuts using non-negativity, Monoidal cut strengthening revisited, Intersection cuts from multiple rows: a disjunctive programming approach, On the relative strength of split, triangle and quadrilateral cuts, A note on the split rank of intersection cuts, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Equivalence between intersection cuts and the corner polyhedron, Stable sets, corner polyhedra and the Chvàtal closure, Intersection cuts for single row corner relaxations, Theoretical challenges towards cutting-plane selection, A quantitative Doignon-Bell-Scarf theorem, Minimal cut-generating functions are nearly extreme, Generalized intersection cuts and a new cut generating paradigm, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets, Outer-product-free sets for polynomial optimization and oracle-based cuts, The triangle closure is a polyhedron, The (not so) trivial lifting in two dimensions, The strength of multi-row aggregation cuts for sign-pattern integer programs, A geometric approach to cut-generating functions, On the facets of mixed integer programs with two integer variables and two constraints, The master equality polyhedron with multiple rows, An algorithm for the separation of two-row cuts, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, Two row mixed-integer cuts via lifting, On Minimal Valid Inequalities for Mixed Integer Conic Programs, Cut-Generating Functions for Integer Variables, Computational Experiments with Cross and Crooked Cross Cuts, On the Practical Strength of Two-Row Tableau Cuts, Helly’s theorem: New variations and applications, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, When Lift-and-Project Cuts Are Different, Operations that Preserve the Covering Property of the Lifting Region, Computing with Multi-row Gomory Cuts, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
