The Traveling Saleman Problem with Many Visits to Few Cities
Name
MIT-LCS-TM-208.pdf
Size
3.06 MB
Format
Adobe PDF
Checksum (MD5)
225f6f9a201691e2c548ec719f24e88a
Author(s)
Cosmadakis, Stavros S.
Papadimitriou, Christos H.
Date Issued
November 1981
Series/Report no.
MIT-LCS-TM-208
Abstract
We study the version of the traveling salesman problem in which a relatively small number of cities -- say, six -- must be visited a huge number of times -- e.g., several hundred times each. )It costs to go from one city to itself). We develop an algorithm for this problem whose running time is exponential in the number of cities, but logarithmic in the number of visits. Our algorithm is a practical approach to the problem for instances of size in the range indicated above. The implementation and analysis of our algorithm give rise to a number of interesting graph-theoretic and counting problems.
Persistent DSpace Link
