Quadratic assignment problem: Difference between revisions

Revision as of 01:32, 10 September 2005

Revision as of 08:31, 27 November 2005

Line 27:

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 the [[computer aided design]] in electronics industry.

== References ==

* {{Book reference|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 | ID = ISBN 0716710455}} A2.5: ND43, pg.218.

[[category:Optimization]]