A Parallel Branch-and-Bound Algorithm for Computing Optimal Task Graph Schedules.
Udo HönigWolfram SchiffmannPublished in: GCC (2) (2003)
Keyphrases
- branch and bound algorithm
- optimal solution
- maximum clique
- lower bound
- branch and bound
- upper bound
- np hard
- search tree
- variable ordering
- lower bounding
- precedence constraints
- upper bounding
- lagrangian relaxation
- scheduling problem
- dynamic programming
- strongly np hard
- graph matching
- linear programming
- search algorithm
- randomly generated problems
- combinatorial optimization
- single machine scheduling problem
- mixed integer linear programming
- max sat
- graph theory
- finding an optimal solution
- objective function
- worst case