Efficient parallel branch-and-bound algorithm for constructing minimum ultrametric trees.
Kun-Ming YuJiayi ZhouChun-Yuan LinChuan Yi TangPublished in: J. Parallel Distributed Comput. (2009)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- test problems
- lower bounding
- optimal solution
- upper bounding
- search tree
- single machine scheduling problem
- np hard
- randomly generated problems
- combinatorial optimization
- lagrangian relaxation
- finding an optimal solution
- distance measure
- neural network