[Clp] Clarification on CLP's branch and bound method?

[Matthew Gidden]

Hi all,

First time listserv user, thanks for being patient with me.

I was initially unaware that CLP supported solving MILPs via a
branch-and-bound algorithm, and am curious what documentation/publications
exist about it. The doxygen documentation provides the rather unhelpful
explanation: "Invoke solver's built-in enumeration algorithm."

I am not surprised to find that CLP and CBC return different optimal
solutions for a given problem instance, and assume that CLP finds a local
optimum rather than global optimum. But I'd like to confirm or refute that
assumption.

Thank you!

-- 
Matthew Gidden
Ph.D. Candidate, Nuclear Engineering
The University of Wisconsin -- Madison
Ph. 225.892.3192
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/clp/attachments/20140207/5a16a862/attachment.html>