On the Applicability of Lower Bounds for Solving Rectilinear Quadratic Assignment Problems in Parallel.
Jens ClausenStefan E. KarischMichael PerregaardFranz RendlPublished in: Comput. Optim. Appl. (1998)
Keyphrases
- quadratic assignment problem
- lower bound
- combinatorial optimization
- upper bound
- stochastic local search
- branch and bound algorithm
- hybrid genetic algorithm
- branch and bound
- objective function
- tabu search
- optimal solution
- traveling salesman problem
- exact solution
- lower and upper bounds
- simulated annealing
- test instances
- genetic algorithm
- orders of magnitude
- mathematical programming
- lagrangian relaxation
- np hard