Parallelization of a branch-and-bound algorithm for the maximum weight clique problem.
Satoshi ShimizuKazuaki YamaguchiSumio MasudaPublished in: Discret. Optim. (2021)
Keyphrases
- maximum weight
- branch and bound algorithm
- np hard
- lower bound
- upper bound
- branch and bound
- independent set
- bipartite graph
- minimum weight
- optimal solution
- lower bounding
- precedence constraints
- upper bounding
- combinatorial optimization
- partial order
- scheduling problem
- single machine scheduling problem
- weighted graph
- finding an optimal solution
- knapsack problem
- shared memory
- approximation algorithms
- worst case
- maximum clique
- cost function
- special case
- computational complexity
- search algorithm