[Cgl] mingling inequality question

[Robin Lougee-Heimer]

Oktay:

Can you respond  and close out this ticekt in the Cgl bug tracking system? 
    A cut & paste is below for your convenience. 

Thanks,
Robin

https://projects.coin-or.org/Cgl/ticket/30

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: 
 http://www.ieor.berkeley.edu/~atamturk/pubs/mingle.pdf 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? 



----------------------------------------------------------------------------------
Robin Lougee-Heimer, PhD
Program Manager, COIN-OR
IBM TJ Watson Research Center
1101 Kitchawan Road, Yorktown Heights, NY 10598
ph: 914-945-3032   fax: 914-945-3434 
robinlh at us.ibm.com
http://www.coin-or.org

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/cgl/attachments/20091210/f97d89a5/attachment.html