[Cgl-tickets] [COIN-OR Cut Generator Library] #30: Mingling inequalities

[COIN-OR Cut Generator Library]

#30: Mingling inequalities
-------------------------+--------------------------------------------------
 Reporter:  nowozin      |       Owner:  somebody
     Type:  enhancement  |      Status:  new     
 Priority:  minor        |   Milestone:          
Component:  Cgl          |     Version:  trunk   
 Keywords:               |  
-------------------------+--------------------------------------------------
 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?

-- 
Ticket URL: <https://projects.coin-or.org/Cgl/ticket/30>
COIN-OR Cut Generator Library <http://projects.coin-or.org/Cgl>
A library of mixed-integer programming cutting plane generators.