The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound.
Ciaran McCreeshPatrick ProsserPublished in: ACM Trans. Parallel Comput. (2015)
Keyphrases
- search tree
- branch and bound algorithm
- branch and bound
- depth first search
- search algorithm
- lower bound
- search space
- optimal solution
- combinatorial optimization
- tree search
- upper bound
- branch and bound search
- column generation
- branch and bound procedure
- max sat
- lagrangian relaxation
- iterative deepening
- np hard
- beam search
- search strategies
- root node
- evolutionary algorithm