Inequalities from Two Rows of a Simplex Tableau

DOI10.1007/978-3-540-72792-7_1zbMath1136.90517OpenAlexW1572542781MaRDI QIDQ5429253

Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey

Publication date: 29 November 2007

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72792-7_1

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items

Intersection cuts for single row corner relaxations, Maximal Quadratic-Free Sets, Constructing Lattice-Free Gradient Polyhedra in Dimension Two, Operations that Preserve the Covering Property of the Lifting Region, Two row mixed-integer cuts via lifting, Mixed-integer sets from two rows of two adjacent simplex bases, Theoretical challenges towards cutting-plane selection, On the facets of mixed integer programs with two integer variables and two constraints, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, On the polyhedrality of cross and quadrilateral closures, Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables, Lattice-free simplices with lattice width \(2d - o(d)\), Multirow Intersection Cuts Based on the Infinity Norm, Partial hyperplane activation for generalized intersection cuts, Computational Experiments with Cross and Crooked Cross Cuts, Unique lifting of integer variables in minimal inequalities, Lattice closures of polyhedra, Towards a characterization of maximal quadratic-free sets, Computing with Multi-row Gomory Cuts, On mixed-integer sets with two integer variables, On the relative strength of split, triangle and quadrilateral cuts, Cut generation through binarization, 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, A proof of Lovász's theorem on maximal lattice-free sets, On the Practical Strength of Two-Row Tableau Cuts, The master equality polyhedron with multiple rows, Composite lifting of group inequalities and an application to two-row mixing inequalities, Strengthening lattice-free cuts using non-negativity, A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts, Monoidal cut strengthening revisited, A 3-slope theorem for the infinite relaxation in the plane, An algorithm for the separation of two-row cuts, A note on the split rank of intersection cuts, Intersection cuts from multiple rows: a disjunctive programming approach, Relaxations of mixed integer sets from lattice-free polyhedra, Approximation of Corner Polyhedra with Families of Intersection Cuts, Sufficiency of cut-generating functions, A quantitative Doignon-Bell-Scarf theorem, A Probabilistic Analysis of the Strength of the Split and Triangle Closures, Cutting planes from extended LP formulations, Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs, On the relative strength of different generalizations of split cuts, Intersection cuts -- standard versus restricted, Cook, Kannan and Schrijver's example revisited, The triangle closure is a polyhedron, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, Relaxations of mixed integer sets from lattice-free polyhedra, Computing with multi-row gomory cuts, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, The (not so) trivial lifting in two dimensions, The strength of multi-row models, On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints, On the implementation and strengthening of intersection cuts for QCQPs, 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, ``Facet separation with one linear program, The aggregation closure is polyhedral for packing and covering integer programs, 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, Constructing lattice-free gradient polyhedra in dimension two, Light on the infinite group relaxation. I: Foundations and taxonomy