Minimal Valid Inequalities for Integer Constraints
From MaRDI portal
Publication:3169050
DOI10.1287/moor.1080.0370zbMath1218.90131OpenAlexW2143273327MaRDI 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
Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Mixed integer programming (90C11) Lattices and convex bodies (number-theoretic aspects) (11H06)
Related Items
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, Two row mixed-integer cuts via lifting, Theoretical challenges towards cutting-plane selection, On the facets of mixed integer programs with two integer variables and two constraints, Lattice-free simplices with lattice width \(2d - o(d)\), Computational Experiments with Cross and Crooked Cross Cuts, Unique lifting of integer variables in minimal inequalities, Computing with Multi-row Gomory Cuts, Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles, On the relative strength of split, triangle and quadrilateral cuts, Enumeration and unimodular equivalence of empty delta-modular simplices, Outer-product-free sets for polynomial optimization and oracle-based cuts, Generalized intersection cuts and a new cut generating paradigm, On the Practical Strength of Two-Row Tableau Cuts, The master equality polyhedron with multiple rows, Strengthening lattice-free cuts using non-negativity, Monoidal cut strengthening revisited, An algorithm for the separation of two-row cuts, Helly’s theorem: New variations and applications, A note on the split rank of intersection cuts, Intersection cuts from multiple rows: a disjunctive programming approach, Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs, A quantitative Doignon-Bell-Scarf theorem, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, The triangle closure is a polyhedron, Equivalence between intersection cuts and the corner polyhedron, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, The (not so) trivial lifting in two dimensions, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints, On the implementation and strengthening of intersection cuts for QCQPs, Minimal cut-generating functions are nearly extreme, On Minimal Valid Inequalities for Mixed Integer Conic Programs, The strength of multi-row aggregation cuts for sign-pattern integer programs, On the implementation and strengthening of intersection cuts for QCQPs, When Lift-and-Project Cuts Are Different, Cut-Generating Functions for Integer Variables, Stable sets, corner polyhedra and the Chvàtal closure, 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, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets, Light on the infinite group relaxation. I: Foundations and taxonomy
