Sign in

A note on a polynomial time solvable case of the quadratic assignment problem.

Günes ErdoganBarbaros Ç. Tansel
Published in: Discret. Optim. (2006)
Keyphrases
  • quadratic assignment problem
  • tabu search
  • lower bound
  • combinatorial optimization
  • integer linear programming formulation
  • neural network
  • machine learning
  • constraint satisfaction
  • test instances