Polynomially solvable special cases of the quadratic bottleneck assignment problem.
Rainer E. BurkardRoswitha RissnerPublished in: J. Comb. Optim. (2011)
Keyphrases
- polynomially solvable
- special case
- np hard
- computational complexity
- makespan minimization
- np complete
- objective function
- approximation algorithms
- processing times
- pairwise
- scheduling problem
- lower bound
- integer programming
- minimum cost
- feasible solution
- branch and bound algorithm
- dynamic programming
- genetic algorithm
- lagrangian relaxation
- worst case
- bayesian networks