[Cbc-tickets] [COIN-OR Branch-and-Cut MIP Solver] #116: Parallel CBC assertion failure

COIN-OR Branch-and-Cut MIP Solver coin-trac at coin-or.org
Fri Jul 8 09:00:45 EDT 2011


#116: Parallel CBC assertion failure
-------------------+--------------------------------------------------------
Reporter:  unxusr  |       Owner:  tkr                 
    Type:  defect  |      Status:  new                 
Priority:  major   |   Component:  Cbc                 
 Version:  trunk   |    Keywords:  parallel cbc CbcTree
-------------------+--------------------------------------------------------
 It's probably related to problems informed in tickets #109 and #110

 After running CBC in parallel for some time there is this assertion
 failure:

 cbc: CbcTree.cpp:457: virtual CbcNode* CbcTree::bestNode(double):
 Assertion `best->nodeInfo()->numberBranchesLeft()' failed.

 In my case I was a solving a small (but very hard) multiple DNA sequence
 alignment problem:

 ...
 Cbc0010I After 132000 nodes, 14298 on tree, -69 best solution, best
 possible -72.052083 (13292.25 seconds)
 cbc: CbcTree.cpp:457: virtual CbcNode* CbcTree::bestNode(double):
 Assertion `best->nodeInfo()->numberBranchesLeft()' failed.

-- 
Ticket URL: <https://projects.coin-or.org/Cbc/ticket/116>
COIN-OR Branch-and-Cut MIP Solver <http://projects.coin-or.org/Cbc>
An LP-based branch-and-cut MIP solver.



More information about the Cbc-tickets mailing list