Lower bounds for the quadratic assignment problem via triangle decompositions.

Stefan E. Karisch Franz Rendl

Published in: Math. Program. (1995)

Keyphrases

quadratic assignment problem
lower bound
upper bound
branch and bound algorithm
integer linear programming formulation
branch and bound
worst case
lower and upper bounds
objective function
optimal solution
np hard
tabu search
combinatorial optimization
max sat
optimization problems
cutting plane