Do Inherently Sequential Branch-and-Bound Algorithms Exist?
Jens ClausenJesper Larsson TräffPublished in: Parallel Process. Lett. (1994)
Keyphrases
- branch and bound
- search algorithm
- lower bound
- branch and bound algorithm
- search space
- upper bound
- column generation
- optimal solution
- branch and bound procedure
- beam search
- branch and bound method
- search strategies
- randomly generated problems
- combinatorial optimization
- tree search algorithm
- tree search
- parallel tree search
- tree decomposition
- network design problem
- lagrangian heuristic
- linear programming relaxation
- max sat
- branch and bound search
- partial solutions
- integer programming problems
- simulated annealing
- case based reasoning