Login / Signup

Two classes of Quadratic Assignment Problems that are solvable as Linear Assignment Problems.

Günes ErdoganBarbaros Ç. Tansel
Published in: Discret. Optim. (2011)
Keyphrases
  • quadratic assignment problem
  • hybrid genetic algorithm
  • np hard
  • lower bound
  • combinatorial optimization
  • computational complexity
  • np complete
  • machine learning
  • learning algorithm
  • special case