[Cbc] How to iteratively cutting the current optimal solution

Thu Sep 3 11:44:11 EDT 2009

Pierre,

Look at the new example driver4b.cpp and see if you can understand it and
if it does something of what you want.  It is only a first attempt.

I had to modify event handling in Cbc (trunk) to do what I wanted

John Forrest

  From:       Pierre.Lebodic at lri.fr                                                                

  To:         cbc at list.coin-or.org                                                                 

  Date:       09/01/2009 03:49 PM                                                                  

  Subject:    [Cbc] How to iteratively cutting the current optimal solution                        

  Sent by:    cbc-bounces at list.coin-or.org                                                         

Hello,

I would like to know if cbc currently supports row addition after a solve,
so as to cut the optimal solution and proceed to the next one. The purpose
is to find a series of close-to-optimal solutions, without solving the
whole ILP each time. Thanks in advance.

Cheers,

Pierre Le Bodic

_______________________________________________
Cbc mailing list
Cbc at list.coin-or.org
http://list.coin-or.org/mailman/listinfo/cbc

-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://list.coin-or.org/pipermail/cbc/attachments/20090903/23180ab7/attachment.html 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: graycol.gif
Type: image/gif
Size: 105 bytes
Desc: not available
Url : http://list.coin-or.org/pipermail/cbc/attachments/20090903/23180ab7/attachment.gif 
-------------- next part --------------
A non-text attachment was scrubbed...
Name: ecblank.gif
Type: image/gif
Size: 45 bytes
Desc: not available
Url : http://list.coin-or.org/pipermail/cbc/attachments/20090903/23180ab7/attachment-0001.gif 