[Cbc] How to iteratively cutting the current optimal solution

[Pierre.Lebodic at lri.fr]

Thanks for your answer. The first thread was indeed close to what I'd like
to do. From what I read from the answer to the second thread, one has to
start from scratch to solve each iteration, losing the whole B&B tree.
I've been unsuccessfully searching for a free MIP solver with this
feature. It seems to be on SYMPHONY roadmap. I hope this gets added soon
to either one! :) Thanks again and sorry for the quick edit grammar error
in the title.

Regards,

Pierre

> Pierre,
> If I'm not mistaken, the same topic was discussed on this list (and the
> Osi list) in July/August, under subject "Several optimal integers
> solutions". See
>
> http://list.coin-or.org/pipermail/cbc/2009-August/000308.html
> http://list.coin-or.org/pipermail/osi/2009-July/000227.html
>
> Regards,
>
> Jan-Willem
>
>
>
> -----Original Message-----
> From: cbc-bounces at list.coin-or.org [mailto:cbc-bounces at list.coin-or.org]
> On Behalf Of Pierre.Lebodic at lri.fr
> Sent: 01 September 2009 21:46
> To: cbc at list.coin-or.org
> Subject: [Cbc] How to iteratively cutting the current optimal solution
>
> 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
>
>
> _______________________________________________
> Cbc mailing list
> Cbc at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/cbc
>