<br><font size=2 face="sans-serif">Oktay:</font>
<br>
<br><font size=2 face="sans-serif">Can you respond and close out
this ticekt in the Cgl bug tracking system? A cut & paste
is below for your convenience. </font>
<br>
<br><font size=2 face="sans-serif">Thanks,</font>
<br><font size=2 face="sans-serif">Robin</font>
<br>
<br><font size=2 face="sans-serif">https://projects.coin-or.org/Cgl/ticket/30</font>
<br>
<br><font size=3>Atamtürk and Günlük describe an extension to mixed integer
rounding inequalities for general mixed integer linear programming which
incorporates variable bound information. In the conclusion to this techreport
they claim it is simple to implement using only the primitives used for
standard MIR separation: </font><a href=http://www.ieor.berkeley.edu/~atamturk/pubs/mingle.pdf><font size=3 color=#c20000> http://www.ieor.berkeley.edu/~atamturk/pubs/mingle.pdf</font></a><font size=3>
I am not familiar with the Cgl MIR implementations and maybe this has been
considered before, but could a COIN-OR expert comment whether it makes
sense to implement the inequalities described? </font>
<br>
<br>
<br><font size=2 face="sans-serif"><br>
----------------------------------------------------------------------------------<br>
Robin Lougee-Heimer, PhD<br>
Program Manager, COIN-OR<br>
IBM TJ Watson Research Center<br>
1101 Kitchawan Road, Yorktown Heights, NY 10598<br>
ph: 914-945-3032 fax: 914-945-3434 <br>
robinlh@us.ibm.com<br>
http://www.coin-or.org<br>
<br>
</font>