Optimal Compile-Time Multiprocessor Scheduling Based on the 0-1 Linear Programming Algorithm with the Branch and Bound Technique.
Douglas Antony Louis PiriyakumarC. Siva Ram MurthyPublished in: J. Parallel Distributed Comput. (1996)
Keyphrases
- optimal solution
- linear programming
- branch and bound
- dynamic programming
- np hard
- search space
- worst case
- lower bound
- branch and bound algorithm
- computational complexity
- upper bound
- implicit enumeration
- depth first search
- cost function
- column generation
- tree search algorithm
- combinatorial optimization
- primal dual
- search strategy
- knapsack problem
- branch and bound procedure
- objective function
- convex hull
- genetic algorithm
- linear program
- approximation algorithms
- space complexity
- probabilistic model
- lower and upper bounds
- special case
- linear programming relaxation
- search algorithm
- integer programming problems