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

DOI10.1016/J.DISOPT.2010.06.001MaRDI QIDQ429671zbMATH OpenOpenAlexFDO

Authors 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

infinite group relaxationsmixed integer programsmixing inequalities

Mathematics Subject Classification ID

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

Recommendations

• Two row mixed-integer cuts via lifting
• New inequalities for finite and infinite group problems from approximate lifting
• Valid inequalities for mips and group polyhedra from approximate liftings
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Constrained infinite group relaxations of MIPs

Cites work

• scientific article; zbMATH DE number 3555734 (Why is no real title available?)
• A note on the split rank of intersection cuts
• Facets of Two-Dimensional Infinite Group Problems
• Inequalities from Two Rows of a Simplex Tableau
• Lifting Integer Variables in Minimal Inequalities Corresponding to Lattice-Free Triangles
• Minimal inequalities for an infinite relaxation of integer programs
• Mixing mixed-integer inequalities
• On degenerate multi-row Gomory cuts
• On lifting integer variables in minimal inequalities
• On mixing inequalities: rank, closure, and cutting-plane proofs
• On the extreme inequalities of infinite group problems
• On the facets of mixed integer programs with two integer variables and two constraints
• Some continuous functions related to corner polyhedra
• Some continuous functions related to corner polyhedra, II
• Strengthening cuts for mixed integer programs
• Two row mixed-integer cuts via lifting

Cited in

(10)

• Nonunique lifting of integer variables in minimal inequalities
• Lifting convex inequalities for bipartite bilinear programs
• Lifting convex inequalities for bipartite bilinear programs
• Monoidal cut strengthening revisited
• Theoretical challenges towards cutting-plane selection
• Lifting properties of maximal lattice-free polyhedra
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Can cut-generating functions be good and efficient?
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set
• Intersection cuts for single row corner relaxations

This page was built for publication: Composite lifting of group inequalities and an application to two-row mixing inequalities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429671)