Quadratic assignment problem: Difference between revisions

Revision as of 16:51, 15 April 2011

Revision as of 18:57, 14 December 2011

Line 30:

==See also==

*[[Quadratic bottleneck assignment problem]]

== References ==

* {{cite book|author = [[Michael R. Garey]] and [[David S. Johnson]] | year = 1979 | title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] | publisher = W.H. Freeman | isbn = 0-7167-1045-5}} A2.5: ND43, pg.218.

== External Links==

* http://www.seas.upenn.edu/qaplib/ QAPLIB - A Quadratic Assignment Problem Library

== References ==

* {{cite book|author = [[Michael R. Garey]] and [[David S. Johnson]] | year = 1979 | title = [[Computers and Intractability: A Guide to the Theory of NP-Completeness]] | publisher = W.H. Freeman | isbn = 0-7167-1045-5}} A2.5: ND43, pg.218.

[[Category:NP-hard problems]]