Revision as of 22:16, 27 January 2006 edit Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 244,915 edits m recat ← Previous edit		Revision as of 19:22, 28 January 2006 edit undo Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 244,915 edits m recat Next edit →
Line 32: * {{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:~~Combinatorial~~NP-complete ~~optimization~~problems]]

Quadratic assignment problem: Difference between revisions