Login / Signup

A level-2 reformulation-linearization technique bound for the quadratic assignment problem.

Warren P. AdamsMonique GuignardPeter M. HahnWilliam L. Hightower
Published in: Eur. J. Oper. Res. (2007)
Keyphrases
  • quadratic assignment problem
  • lower bound
  • upper bound
  • branch and bound algorithm
  • computational complexity
  • tabu search
  • combinatorial optimization
  • integer linear programming formulation