Composite lifting of group inequalities and an application to two-row mixing inequalities

DOI10.1016/j.disopt.2010.06.001zbMath1242.90128MaRDI 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

zbMATH Keywords

mixed integer programs; infinite group relaxations; mixing inequalities

Mathematics Subject Classification ID

90C11: Mixed integer programming

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

Related Items

Can Cut-Generating Functions Be Good and Efficient?, Nonunique Lifting of Integer Variables in Minimal Inequalities, Monoidal cut strengthening revisited, Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra, Lifting properties of maximal lattice-free polyhedra, Intersection cuts for single row corner relaxations, Theoretical challenges towards cutting-plane selection, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set

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