Implementation of parallel branch-and-bound algorithms - experiences with the graph partitioning problem.
Jens ClausenJesper Larsson TräffPublished in: Ann. Oper. Res. (1991)
Keyphrases
- graph partitioning
- branch and bound algorithm
- partitioning algorithm
- lower bound
- graph model
- branch and bound
- weighted graph
- set covering problem
- optimal solution
- image segmentation
- np hard
- normalized cut
- upper bound
- search tree
- spectral clustering
- boolean satisfiability
- haplotype inference
- spectral graph
- data clustering
- image processing
- metaheuristic
- search space
- pairwise
- search algorithm
- clustering algorithm