Revision as of 16:38, 7 August 2013 edit Duoduoduo (talk \| contribs) Extended confirmed users, Pending changes reviewers 11,085 edits →Formal mathematical definition: rm redundant link that in any event went to a dab page ← Previous edit		Revision as of 18:25, 13 August 2013 edit undo Duoduoduo (talk \| contribs) Extended confirmed users, Pending changes reviewers 11,085 edits m →Computational complexity: decapitalizing word in middle of sentence Next edit →
Line 28: == Computational complexity == The problem is [[NP-hard]], so there is no known [[algorithm]] for solving this problem in polynomial time, and even small instances may require long computation time. The [[~~Travelling~~travelling salesman problem]] may be seen as a special case of QAP if one assumes that the flows connect all facilities only along a single ring, all flows have the same non-zero (constant) value. Many other problems of standard [[combinatorial optimization]] problems may be written in this form. == Applications ==

Quadratic assignment problem: Difference between revisions