A branch-and-cut algorithm for quadratic assignment problems based on linearizations.

Günes Erdogan Barbaros Ç. Tansel

Published in: Comput. Oper. Res. (2007)

Keyphrases

learning algorithm
dynamic programming
improved algorithm
quadratic assignment problem
cost function
simulated annealing
computational complexity
lower bound
search space
benchmark problems
optimal solution
np hard
upper bound
convex hull
randomly generated