<html>
<head>
<meta http-equiv="Content-Type" content="text/html;
charset=windows-1252">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<p>Hi,</p>
<p><br>
</p>
<p>To call CBC from your code with all the settings of the
standalone solver (which are much better than just calling branch
and bound), please look at the "driver3" example included.</p>
<p>Basically you should use CbcMain0 and CbcMain1:</p>
<pre style="color: rgb(0, 0, 0); font-style: normal; font-variant-ligatures: normal; font-variant-caps: normal; font-weight: 400; letter-spacing: normal; orphans: 2; text-align: start; text-indent: 0px; text-transform: none; widows: 2; word-spacing: 0px; -webkit-text-stroke-width: 0px; text-decoration-style: initial; text-decoration-color: initial;"> CbcModel model(*solver.getRealSolverPtr());
CbcMain0(model);
CbcMain1(3, args, model);
</pre>
Cheers,<br>
<br>
Haroldo<br>
<div class="moz-cite-prefix">Em 21-02-2018 11:33, Andrea Manno
escreveu:<br>
</div>
<blockquote type="cite"
cite="mid:VI1PR06MB1758A617BD655E82C72A98F887CE0@VI1PR06MB1758.eurprd06.prod.outlook.com">
<meta http-equiv="Content-Type" content="text/html;
charset=windows-1252">
<style type="text/css" style="display:none;"><!-- P {margin-top:0;margin-bottom:0;} --></style>
<div id="divtagdefaultwrapper"
style="font-size:12pt;color:#000000;font-family:Calibri,Helvetica,sans-serif;"
dir="ltr">
<p style="margin-top:0;margin-bottom:0">Dear all,</p>
<p style="margin-top:0;margin-bottom:0"><br>
</p>
<p style="margin-top:0;margin-bottom:0"><span>I am using the
callable version of CBC as the MILP solver unit included in
a C++ code. So what I have done is nothing but including all
the Cbc, Osi and Cgl header file needed and linking all the
necessary libraries in order to use the branchAnbBound()
method of the CbcModel class. However, I noticed a
deterioring of performance (in terms of CPU-time) compared
to <span>the stand-alone executable version of Cbc used as
AMPL solver. I managed to eliminate this gap of
performance for relatively small problems, by adding some
Cbc heuristics and cuts, but the problem persists for
bigger problems. I would like to know if there is a way to
tune all the preprocess, cuts, heuristics and other
options in order to replicate the same performance of the
stand-alone version of Cbc. <br>
</span></span></p>
<p style="margin-top:0;margin-bottom:0"><span><span><br>
</span></span></p>
<p style="margin-top:0;margin-bottom:0"><span><span>Thank you so
much,</span></span></p>
<p style="margin-top:0;margin-bottom:0"><span><span><br>
</span></span></p>
<p style="margin-top:0;margin-bottom:0"><span><span>Andrea Manno<br>
</span></span></p>
<p style="margin-top:0;margin-bottom:0"><span><br>
</span></p>
</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://list.coin-or.org/mailman/listinfo/cbc">https://list.coin-or.org/mailman/listinfo/cbc</a>
</pre>
</blockquote>
<br>
<pre class="moz-signature" cols="72">--
=============================================================
Haroldo Gambini Santos
Computing Department
Universidade Federal de Ouro Preto - UFOP
email: <a class="moz-txt-link-abbreviated" href="mailto:haroldo@ufop.edu.br">haroldo@ufop.edu.br</a>
home/research page: <a class="moz-txt-link-abbreviated" href="http://www.decom.ufop.br/haroldo">www.decom.ufop.br/haroldo</a>
It has long been an axiom of mine that the little things are infinitely
the most important.
-- Sir Arthur Conan Doyle, "A Case of Identity"</pre>
</body>
</html>