<font face="arial,helvetica,sans-serif"><div>Dear All,</div><div><br></div><div>I'm using cbc to build a pool of solutions for a MIP problem.</div><div><br></div><div>My objective is not only to find the optimal solution, but to find many different, close to optimal solutions.</div>
<div><br></div><div>Since I want to process every solution found I wrote a specialization of </div><div><br></div><div>CbcEventHandler</div><div><br></div><div>Looking in cbc examples (driver4.cpp) I noted that after checking for events</div>
<div> solution or heuristicSolution </div></font><div><br></div><div>The event handler calls </div><div> model->bestSolution</div><div><br></div><div>to get the solution found.</div><div><br></div><div>
My question is: what if the last solution found by a heuristic is not the best found so far ??? </div><div>Would it be better to access the solution pool (savedSolution[numberSolutions-1]) ?</div><div><br></div><div>Thanks in advance,</div>
<div><br></div><div><br></div><div><br></div><br>-- <br>=============================================================<br>Haroldo Gambini Santos<br>Computing Department - Universidade Federal de Ouro Preto - UFOP<br>email: haroldo [at ] <a href="http://iceb.ufop.br">iceb.ufop.br</a><br>
home/research page: <a href="http://www.iceb.ufop.br/decom/prof/haroldo/">http://www.iceb.ufop.br/decom/prof/haroldo/</a><br> <br>"Computer science is no more about computers than astronomy <br>is about telescopes." Edsger Dijkstra<br>
<br>