Revision as of 06:52, 13 June 2005 edit Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 244,915 edits m Reverted edits by 211.31.65.48 to last version by Mathbot ← Previous edit		Revision as of 19:10, 26 June 2005 edit undo Grotmol (talk \| contribs) 3 edits →[[Computational complexity]]: It is not correct that Travellling Salesman is a special case of the Quadratic Assignment Problem. Next edit →
Line 23: The problem is [[NP-hard]], i.e., requires long computation time even it its simplified cases, e.g., when all flows are equal to 1. ~~For example, the [[Travelling salesman problem]] may be seen as a special case of QAP, if one assumes that the flows connect facilities only along a single ring, all flows having the value of 1.~~ Many other problems of standard [[combinatorial optimization]] problems may be written in this form. == Applications ==

Quadratic assignment problem: Difference between revisions