The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound.
Ciaran McCreeshPatrick ProsserPublished in: CoRR (2014)
Keyphrases
- search tree
- branch and bound algorithm
- branch and bound
- depth first search
- search algorithm
- lower bound
- search space
- tree search
- upper bound
- combinatorial optimization
- optimal solution
- column generation
- branch and bound search
- branch and bound procedure
- root node
- lagrangian relaxation
- max sat
- beam search
- search strategies
- np hard
- iterative deepening
- heuristic function
- hill climbing
- probabilistic model
- monte carlo
- constraint satisfaction problems
- knn