[Cbc] Documentation on difference between Clp and Cbc's branch and bounds?

Haroldo Gambini Santos haroldo.santos at gmail.com
Wed Feb 26 11:46:35 EST 2014


Hi Matthew,

Are you referring to the one called by the command line ?

Cbc has strong branching,  cuts and heuristics, it is not a "pure" B&B - 
it should be smarter than CLP in most cases.

Clp has a pure branch and bound.

Cheers,

Haroldo


On 25-02-2014 15:25, Matthew Gidden wrote:
> Hi all,
>
> I was curious if there are any publications or additional 
> documentation on the branch and bound methods implemented in the Cbc 
> and Clp models (assuming there is a difference)?
>
> -- 
> Matthew Gidden
> Ph.D. Candidate, Nuclear Engineering
> The University of Wisconsin -- Madison
> Ph. 225.892.3192
>
>
> _______________________________________________
> Cbc mailing list
> Cbc at list.coin-or.org
> http://list.coin-or.org/mailman/listinfo/cbc

-- 
==================================================
Haroldo Gambini Santos
D.Sc, Computer Science
Universidade Federal de Ouro Preto
http://www.decom.ufop.br/haroldo/

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/cbc/attachments/20140226/0f01d7a9/attachment.html>


More information about the Cbc mailing list