A parallel branch-and-bound algorithm for multicommodity location with balancing requirements.
Bernard GendronTeodor Gabriel CrainicPublished in: Comput. Oper. Res. (1997)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- optimal solution
- np hard
- test problems
- lower bounding
- combinatorial optimization
- precedence constraints
- search tree
- network design problem
- upper bounding
- randomly generated problems
- branch and bound method
- lagrangian relaxation
- single machine scheduling problem
- mixed integer linear programming
- network design
- variable ordering
- parallel computing
- search space
- finding an optimal solution
- maximum clique