A Parallel Branch and Bound Algorithm for Workflow QoS Optimization.
Kevin KoflerIrfan Ul HaqErich SchikutaPublished in: ICPP (2009)
Keyphrases
- branch and bound algorithm
- combinatorial optimization
- lower bound
- branch and bound
- upper bound
- lower bounding
- np hard
- search tree
- optimal solution
- web services
- optimization problems
- test problems
- precedence constraints
- quality of service
- upper bounding
- single machine scheduling problem
- branch and bound method
- randomly generated problems
- shortest processing time
- variable ordering
- mixed integer linear programming
- optimization algorithm
- lagrangian relaxation
- integer variables
- finding an optimal solution
- maximum clique
- max sat
- shared memory