How Much Communication Does Parallel Branch and Bound Need?
Jonathan EcksteinPublished in: INFORMS J. Comput. (1997)
Keyphrases
- branch and bound
- search algorithm
- branch and bound algorithm
- depth first search
- lower bound
- search space
- optimal solution
- column generation
- upper bound
- randomly generated problems
- branch and bound procedure
- combinatorial optimization
- beam search
- tree search algorithm
- tree search
- network design problem
- branch and bound method
- communication networks
- search strategies
- parallel processing
- linear programming relaxation
- lagrangian heuristic
- branch and bound search
- max sat
- partial solutions
- evolutionary algorithm
- dynamic programming
- integer programming problems
- mini bucket
- genetic algorithm