A branch-and-bound algorithm for the quadratic assignment problem based on the Hungarian method.

Peter Hahn Thomas Grant Nat Hall

Published in: Eur. J. Oper. Res. (1998)

Keyphrases

branch and bound algorithm
lower bound
objective function
cost function
dynamic programming
constraint satisfaction
combinatorial optimization
quadratic assignment problem
neural network
genetic algorithm
similarity measure
computational complexity
np hard
traveling salesman problem