Content deleted Content added
Citation bot (talk | contribs) m Alter: title. Add: title-link, hdl, pages. Removed URL that duplicated unique identifier. Removed accessdate with no specified URL. Formatted dashes. | You can use this bot yourself. Report bugs here.| Activated by User:Marianne Zimmerman |
m Open access bot: hdl added to citation with #oabot. |
||
Line 38:
|pages = 555–565
|journal = Journal of the ACM|doi = 10.1145/321958.321975|pmid = |hdl = 10338.dmlcz/103883
|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.
== Applications ==
| |||