<div dir="ltr">Hi all,<div><br></div><div>First time listserv user, thanks for being patient with me.</div><div><br></div><div>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: "<span style="color:rgb(0,0,0);font-family:Roboto,sans-serif;font-size:14px;line-height:19px">Invoke solver's built-in enumeration algorithm."</span></div>
<div><br></div><div>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.</div>
<div><br></div><div>Thank you!<br clear="all"><div><br></div>-- <br><div dir="ltr">Matthew Gidden<br>Ph.D. Candidate, Nuclear Engineering<div>The University of Wisconsin -- Madison<br>Ph. 225.892.3192<br></div></div>
</div></div>