Content deleted Content added
Append link https://apps.microsoft.com/store/detail/qapsolver/9N7WMCFB6NZZ - Metaheuristic QAP solver for Windows 10/11 |
Cerotidinon (talk | contribs) m →Computational complexity: Slightly expanded explanation of TSP |
||
Line 38:
|pages = 555–565
|journal = Journal of the ACM|doi = 10.1145/321958.321975|hdl = 10338.dmlcz/103883
|hdl-access = free}}</ref> The [[travelling salesman problem]] (TSP) 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 and all distances are equal to the respective distances of the TSP instance. Many other problems of standard [[combinatorial optimization]] problems may be written in this form.
== Applications ==
| |||