Inequalities from Two Rows of a Simplex Tableau
From MaRDI portal
Publication:5429253
DOI10.1007/978-3-540-72792-7_1zbMath1136.90517MaRDI 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
Related Items
Approximation of Corner Polyhedra with Families of Intersection Cuts, 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, 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, Light on the infinite group relaxation. I: Foundations and taxonomy, On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts, On the polyhedrality of cross and quadrilateral closures, Unique lifting of integer variables in minimal inequalities, On mixed-integer sets with two integer variables, 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, Intersection cuts from multiple rows: a disjunctive programming approach, Sufficiency of cut-generating functions, Cutting planes from extended LP formulations, 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, Cut generation through binarization, Cook, Kannan and Schrijver's example revisited, Computing with multi-row gomory cuts, 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, On the relative strength of different generalizations of split cuts, Intersection cuts -- standard versus restricted, Generalized intersection cuts and a new cut generating paradigm, A proof of Lovász's theorem on maximal lattice-free sets, On a generalization of the Chvátal-Gomory closure, Maximal quadratic-free sets, Constructing lattice-free gradient polyhedra in dimension two, Partial hyperplane activation for generalized intersection cuts, Lattice closures of polyhedra, Outer-product-free sets for polynomial optimization and oracle-based cuts, The triangle closure is a polyhedron, Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming, The (not so) trivial lifting in two dimensions, The strength of multi-row aggregation cuts for sign-pattern integer programs, ``Facet separation with one linear program, 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, A 3-slope theorem for the infinite relaxation in the plane, An algorithm for the separation of two-row cuts, The strength of multi-row models, Two row mixed-integer cuts via lifting, Mixed-integer sets from two rows of two adjacent simplex bases, 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, 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
