A note on the MIR closure

Authors:
Pierre Bonami;GéRard CornuéJols
Affiliations:
IBM T.J. Watson Research Center, P.O. Box 218, Yorktown Heights, USA and LIF, Faculté des Sciences de Luminy, 13288 Marseille, France;Tepper School of Business, Carnegie Mellon University, Pittsburgh, PA 15213, USA and LIF, Faculté des Sciences de Luminy, 13288 Marseille, France
Venue:
Operations Research Letters
Year:
2008

Citing 5
Cited 0

Integer and combinatorial optimization

Integer and combinatorial optimization
A recursive procedure to generate all cuts for 0-1 mixed integer programs

Mathematical Programming: Series A and B
Chva´tal closures for mixed integer programming problems

Mathematical Programming: Series A and B
Aggregation and Mixed Integer Rounding to Solve MIPs

Operations Research
On the MIR Closure of Polyhedra

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In 1988, Nemhauser and Wolsey introduced the concept of MIR inequality for mixed integer linear programs. In 1998, Wolsey gave another definition of MIR inequalities. This note points out that the natural concepts of MIR closures derived from these two definitions are distinct. Dash, Gunluk and Lodi made the same observation independently.