Experiences with a Synchronous Parallel Branch and Bound Algorithm.
Per S. LaursenPublished in: Parallel Processing of Discrete Optimization Problems (1994)
Keyphrases
- branch and bound algorithm
- branch and bound
- lower bound
- randomly generated
- upper bound
- test problems
- lower bounding
- optimal solution
- precedence constraints
- np hard
- combinatorial optimization
- search tree
- mixed integer linear programming
- randomly generated problems
- lagrangian relaxation
- upper bounding
- single machine scheduling problem
- search algorithm
- max sat
- branch and bound method
- special case
- variable ordering
- finding an optimal solution
- parallel computing
- shared memory