Content deleted Content added
Added reference to first paper. |
m Task 18 (cosmetic): eval 2 templates: del empty params (1×); |
||
Line 37:
|volume=23 |issue=3
|pages = 555–565
|journal = Journal of the ACM|doi = 10.1145/321958.321975
|hdl-access = free}}</ref> The [[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.
| |||