Content deleted Content added
{Cite journal} correction |
m →Computational complexity: task, replaced: Journal of the ACM (JACM) → Journal of the ACM using AWB |
||
Line 34:
|date = July 1976
|volume=23 |issue=3
|journal = Journal of the ACM
|doi = 10.1145/321958.321975|pmid = }}</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.
| |||