A randomized parallel branch-and-bound algorithm.
Virendra K. JanakiramEdward F. GehringerDharma P. AgrawalRavi MehrotraPublished in: Int. J. Parallel Program. (1988)
Keyphrases
- branch and bound algorithm
- lower bound
- branch and bound
- upper bound
- test problems
- randomly generated
- lower bounding
- np hard
- precedence constraints
- optimal solution
- search tree
- upper bounding
- combinatorial optimization
- single machine scheduling problem
- finding an optimal solution
- variable ordering
- search algorithm
- lagrangian relaxation
- max sat
- randomly generated problems
- branch and bound method
- shared memory
- mixed integer linear programming
- search space
- parallel machines
- maximum clique
- integer variables
- similarity measure