<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<div class="moz-cite-prefix">Marco,<br>
<br>
In Branch and Bound the dual simplex algorithm is normally used
and some network "tricks" only work with primal. Clp (and so Cbc)
can be faster it told that it has a network.<br>
<br>
BUT the minute you add cuts, it is no longer a network and in 99%
of cases Branch and Bound is much faster with cuts.<br>
<br>
John Forrest <br>
On 07/09/17 09:38, mg wrote:<br>
</div>
<blockquote type="cite"
cite="mid:CAOayR=Yt+CfrKr_Oo40kvSCYdmk67uK8Ke7tiFcAN0Mc6edmOw@mail.gmail.com">
<div dir="ltr">
<div>
<div>
<div>Hi All,<br>
</div>
I was wondering if it's possible to configure CBC (an
argument?) in order to use a "network" solver (which, for
network structured matrices should be much faster than
normal simplex), but I couldn't find any information about
this... is it available ?<br>
<br>
</div>
Thanks in advance,<br>
</div>
Marco<br>
</div>
<br>
<fieldset class="mimeAttachmentHeader"></fieldset>
<br>
<pre wrap="">_______________________________________________
Cbc mailing list
<a class="moz-txt-link-abbreviated" href="mailto:Cbc@list.coin-or.org">Cbc@list.coin-or.org</a>
<a class="moz-txt-link-freetext" href="https://urldefense.proofpoint.com/v2/url?u=https-3A__list.coin-2Dor.org_mailman_listinfo_cbc&d=DwICAg&c=Ngd-ta5yRYsqeUsEDgxhcqsYYY1Xs5ogLxWPA_2Wlc4&r=js2M0T-3OIMIVDvokcKjokJbk0F8QOCd0mT4FsVFE88&m=VKC8Csot3rzD0gQkHXWCIU78S03IoJmo3AcLfi-2iWo&s=6E12Kfh6rHy8ZIIQ_b0w5BqS9D0gRZ3Kg5ORRJSCtxY&e=">https://urldefense.proofpoint.com/v2/url?u=https-3A__list.coin-2Dor.org_mailman_listinfo_cbc&d=DwICAg&c=Ngd-ta5yRYsqeUsEDgxhcqsYYY1Xs5ogLxWPA_2Wlc4&r=js2M0T-3OIMIVDvokcKjokJbk0F8QOCd0mT4FsVFE88&m=VKC8Csot3rzD0gQkHXWCIU78S03IoJmo3AcLfi-2iWo&s=6E12Kfh6rHy8ZIIQ_b0w5BqS9D0gRZ3Kg5ORRJSCtxY&e=</a>
</pre>
</blockquote>
<p><br>
</p>
</body>
</html>