Quadratic assignment problem: Difference between revisions

Revision as of 18:38, 2 April 2010

Revision as of 04:30, 20 May 2010

Line 29:

In addition to the original plant ___location formulation, QAP is a mathematical model for the problem of placement of interconnected [[electronic component]]s onto a [[printed circuit board]] or on a [[integrated circuit|microchip]], which is part of the [[place and route]] stage of [[computer aided design]] in the electronics industry.

==See also==

*[[Quadraric bottleneck assignment problem]]

== References ==

Line 34 ⟶ 37:

* {{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-completehard problems]]

[[Category:combinatorial optimization]]

[[es:Problema de la asignación cuadrática]]