A note on the MIR closure

  title={A note on the MIR closure},
  author={Pierre Bonami and G{\'e}rard Cornu{\'e}jols},
  journal={Oper. Res. Lett.},
In 1988, Nemhauser and Wolsey introduced the concept of MIR inequality for mixed integer linear programs. In 1998, Wolsey defined MIR inequalities differently. In some sense these definitions are equivalent. However, this note points out that the natural concepts of MIR closures derived from these two definitions are distinct. Dash, Günlük and Lodi made the same observation independently. Let S := {(x, y) ∈ Z+ × R p + : Ax + Gy ≤ b} be a mixed integer set. Here A ∈ Rm×n and G ∈ Rm×p are… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.


Publications citing this paper.
Showing 1-2 of 2 extracted citations


Publications referenced by this paper.
Showing 1-8 of 8 references

Separating from the MIR closure of polyhedra

S. Dash, O. Günlük, A. Lodi
presentation at the International Symposium on Mathematical Programming, Rio de Janeiro, Brazil • 2006
View 4 Excerpts
Highly Influenced

Mixed Integer Programming

Wiley Encyclopedia of Computer Science and Engineering • 2008
View 6 Excerpts
Highly Influenced

Aggregation and Mixed Integer Rounding to Solve MIPs

Operations Research • 2001
View 7 Excerpts
Highly Influenced

Integer and combinatorial optimization

Wiley interscience series in discrete mathematics and optimization • 1988
View 6 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…