Two row mixed-integer cuts via lifting
From MaRDI portal
Publication:2638372
DOI10.1007/s10107-010-0362-xzbMath1247.90205OpenAlexW2150339943MaRDI QIDQ2638372
Laurence A. Wolsey, Santanu S. Dey
Publication date: 16 September 2010
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0362-x
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Intersection cuts for single row corner relaxations, Operations that Preserve the Covering Property of the Lifting Region, Two row mixed-integer cuts via lifting, Theoretical challenges towards cutting-plane selection, On the polyhedrality of cross and quadrilateral closures, Computational Experiments with Cross and Crooked Cross Cuts, Monoidal strengthening and unique lifting in MIQCPs, Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Towards a characterization of maximal quadratic-free sets, Lifting properties of maximal lattice-free polyhedra, Composite lifting of group inequalities and an application to two-row mixing inequalities, 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, Nonunique Lifting of Integer Variables in Minimal Inequalities, Intersection cuts from multiple rows: a disjunctive programming approach, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Optimality certificates for convex minimization and Helly numbers, Inequalities for the lattice width of lattice-free convex sets in the plane, Can Cut-Generating Functions Be Good and Efficient?, Relaxations of mixed integer sets from lattice-free polyhedra, Approximate and exact merging of knapsack constraints with cover inequalities, Design and Verify: A New Scheme for Generating Cutting-Planes, Some cut-generating functions for second-order conic sets, 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, 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, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs, When Lift-and-Project Cuts Are Different, On the Polyhedrality of Closures of Multibranch Split Sets and Other Polyhedra with Bounded Max-Facet-Width, An extremal property of lattice polygons, Cut-Generating Functions for Integer Variables, A geometric approach to cut-generating functions, Light on the infinite group relaxation. I: Foundations and taxonomy
Cites Work
- Unnamed Item
- Unnamed Item
- Mixed-integer cuts from cyclic groups
- Chvátal closures for mixed integer programming problems
- On the strength of Gomory mixed-integer cuts as group cuts
- Valid inequalities for mips and group polyhedra from approximate liftings
- Strengthening cuts for mixed integer programs
- Corner polyhedra and their connection with cutting planes
- T-space and cutting planes
- Cyclic group and knapsack facets
- A recursive procedure to generate all cuts for 0-1 mixed integer programs
- Some polyhedra related to combinatorial problems
- Valid inequalities based on simple mixed-integer sets
- Two row mixed-integer cuts via lifting
- K-Cuts: A Variation of Gomory Mixed Integer Cuts from the LP Tableau
- Minimal Valid Inequalities for Integer Constraints
- Integer Programming and Pricing
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- New inequalities for finite and infinite group problems from approximate lifting
- Characterization of facets for multiple right-hand choice linear programs
- Disjunctive Programming
- Facets of Two-Dimensional Infinite Group Problems
- Inequalities from Two Rows of a Simplex Tableau
- Sequential-Merge Facets for Two-Dimensional Group Problems
- On the Facets of Mixed Integer Programs with Two Integer Variables and Two Constraints
- Intersection Cuts—A New Type of Cutting Planes for Integer Programming
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Elementary closures for integer programs.
