A note on the MIR closure

DOI10.1016/j.orl.2007.03.011zbMath1161.90446OpenAlexW2084285121MaRDI QIDQ924876

Pierre Bonami, Cornuéjols, Gérard

Publication date: 29 May 2008

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2007.03.011

zbMATH Keywords

mixed integer linear programmixed integer roundingMIR

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

MIR closures of polyhedral sets, Valid inequalities for mixed integer linear programs

Cites Work

• Chvátal closures for mixed integer programming problems
• A recursive procedure to generate all cuts for 0-1 mixed integer programs
• Aggregation and Mixed Integer Rounding to Solve MIPs
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• On the MIR Closure of Polyhedra
• On the rank of mixed 0,1 polyhedra.
• Unnamed Item
• Unnamed Item