[Coin-discuss] How to cut off "optimal" solution in CBC

[Francois Margot]

Every Branch-and-Cut code that I have used before (Minto, Abacus, Bcp, 
Symphony) uses one method for the feasibility check and one method for the 
cut generation. It is the only clean solution, as far as I know.

Francois


>
> Message: 6
> Date: Wed, 24 Aug 2005 10:55:23 -0400
> From: John J Forrest <jjforre at us.ibm.com>
> Subject: Re: [Coin-discuss] How to cut off "optimal" solution in CBC
> To: Discussions about open source software for Operations Research
> 	<coin-discuss at list.coin-or.org>
> Message-ID:
> 	<OFD3E00337.E64433B2-ON04257067.0051846A-04257067.0051B086 at us.ibm.com>
> Content-Type: text/plain; charset="us-ascii"
>
> Tobias,
>
> I agree with you but I am not sure this is a common enough requirement so
> I was just proposing minimal work solution.
>
> What do people think?
>
> John Forrest
>