6 ms·
To explain it even easier: every integer addition problem can be transformed into a TSP problem, but not vice-versa.
by adgar 15y ago
To explain it even easier: every integer addition problem can be transformed into a TSP problem, but not vice-versa.
- joshAg 15y agothat would be an awesome entry into a rube goldberg contest...
- adgar 15y agoBasic start to a rigorous solution: Input: A, B : integers Output: directed graph G(V, E, w) (V = vertices, E = edges, w = weight fn) V = {c1, c2, c3} E = {(c1, c2), (c2, c3), (c3, c1)} w(c1, c2) = A w(c2, c3) = B w(c3, c1) = 0 shortest tour is the only valid tour whose length is clearly A + B.