A Branch-and-Bound Based Exact Algorithm for the Maximum Edge-Weight Clique Problem.
Satoshi ShimizuKazuaki YamaguchiSumio MasudaPublished in: CSII (selected papers) (2018)
Keyphrases
- branch and bound
- optimal solution
- search space
- lower bound
- np hard
- tree search
- search algorithm
- cost function
- worst case
- computational complexity
- combinatorial optimization
- objective function
- minimum spanning tree
- branch and bound algorithm
- simulated annealing
- distance metric
- beam search
- segmentation algorithm
- upper bound
- space complexity
- multi objective
- bayesian networks
- branch and bound search
- branch and bound procedure