Composite lifting of group inequalities and an application to two-row mixing inequalities
From MaRDI portal
Publication:429671
DOI10.1016/j.disopt.2010.06.001zbMath1242.90128OpenAlexW2076416724MaRDI QIDQ429671
Santanu S. Dey, Laurence A. Wolsey
Publication date: 20 June 2012
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2010.06.001
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items
Intersection cuts for single row corner relaxations, Theoretical challenges towards cutting-plane selection, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, Lifting properties of maximal lattice-free polyhedra, Monoidal cut strengthening revisited, Nonunique Lifting of Integer Variables in Minimal Inequalities, Can Cut-Generating Functions Be Good and Efficient?, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Lifting convex inequalities for bipartite bilinear programs, Lifting convex inequalities for bipartite bilinear programs
Cites Work
- Unnamed Item
- A note on the split rank of intersection cuts
- On the extreme inequalities of infinite group problems
- On degenerate multi-row Gomory cuts
- Strengthening cuts for mixed integer programs
- On the facets of mixed integer programs with two integer variables and two constraints
- Two row mixed-integer cuts via lifting
- Minimal Inequalities for an Infinite Relaxation of Integer Programs
- Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
- On Mixing Inequalities: Rank, Closure, and Cutting-Plane Proofs
- On Lifting Integer Variables in Minimal Inequalities
- Facets of Two-Dimensional Infinite Group Problems
- Inequalities from Two Rows of a Simplex Tableau
- Some continuous functions related to corner polyhedra
- Some continuous functions related to corner polyhedra, II
- Mixing mixed-integer inequalities
