A Dynamic-Programming Bound for the Quadratic Assignment Problem.
Ambros MarzettaAdrian BrünggerPublished in: COCOON (1999)
Keyphrases
- quadratic assignment problem
- dynamic programming
- lower bound
- upper bound
- lagrangian relaxation
- tabu search
- integer linear programming formulation
- branch and bound algorithm
- branch and bound
- combinatorial optimization
- linear programming
- knapsack problem
- objective function
- state space
- worst case
- greedy algorithm
- np hard
- test instances
- stochastic local search
- genetic algorithm
- optimal solution
- reinforcement learning
- neural network
- metaheuristic
- simulated annealing
- scheduling problem
- feature space
- training data