On the best search strategy in parallel branch-and-bound: Best-First Search versus Lazy Depth-First Search.
Jens ClausenMichael PerregaardPublished in: Ann. Oper. Res. (1999)
Keyphrases
- depth first search
- branch and bound
- search strategy
- search algorithm
- search space
- search strategies
- tree search
- branch and bound algorithm
- branch and bound search
- column generation
- search tree
- lower bound
- heuristic search
- beam search
- iterative deepening
- hill climbing
- upper bound
- optimal solution
- metaheuristic
- search methods
- bnb adopt
- search procedure
- combinatorial optimization
- search problems
- constraint satisfaction problems
- alpha beta
- path finding
- tabu search
- game tree
- state space
- combinatorial search
- objective function
- parallel tree search