Monoidal cut strengthening revisited

DOI10.1016/j.disopt.2011.11.002zbMath1242.90115OpenAlexW2071292024MaRDI QIDQ435731

Andrea Qualizza, Egon Balas

Publication date: 12 July 2012

Published in: Discrete Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disopt.2011.11.002

zbMATH Keywords

mixed integer programmingdisjunctive cutsGomory mixed integer cut

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Monoidal strengthening of simple \(\mathcal{V} \)-polyhedral disjunctive cuts, Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints, Minimal cut-generating functions are nearly extreme

Cites Work

• Unnamed Item
• Composite lifting of group inequalities and an application to two-row mixing inequalities
• Two dimensional lattice-free cuts and asymmetric disjunctions for mixed-integer polyhedra
• Strengthening cuts for mixed integer programs
• Two row mixed-integer cuts via lifting
• Minimal Valid Inequalities for Integer Constraints
• Disjunctive Programming
• Inequalities from Two Rows of a Simplex Tableau
• Intersection Cuts—A New Type of Cutting Planes for Integer Programming