Finding Tours in the TSP

Simple item page
dc.contributor.authorApplegate, Daviden_US
dc.contributor.authorBixby, Roberten_US
dc.contributor.authorChvatal, Vaseken_US
dc.contributor.authorCook, Williamen_US
dc.date.accessioned2018-06-18T17:47:32Zen_US
dc.date.available2018-06-18T17:47:32Zen_US
dc.date.issued1999-05en_US
dc.date.noteMay 1999en_US
dc.description.abstractThe traveling salesman problem, or TSP for short, is easy to state: given a finite number of "cities" along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point. The travel costs are symmetric in the sense that traveling from city X to city Y costs just as much as traveling from Y to X; the "way of visiting all the cities" is simply the order in which the cities are visited. In this report we consider the relaxed version of the TSP where we ask only for a tour of low cost. This is a preliminary version of a chapter of planned monograph on the TSP.en_US
dc.format.extent60 ppen_US
dc.identifier.citationApplegate, David, Bixby, Robert, Chvatal, Vasek, et al.. "Finding Tours in the TSP." (1999) <a href="https://hdl.handle.net/1911/101911">https://hdl.handle.net/1911/101911</a>.en_US
dc.identifier.digitalTR99-05en_US
dc.identifier.urihttps://hdl.handle.net/1911/101911en_US
dc.language.isoengen_US
dc.titleFinding Tours in the TSPen_US
dc.typeTechnical reporten_US
dc.type.dcmiTexten_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR99-05.pdf
Size:
486.74 KB
Format:
Adobe Portable Document Format
Download
Collections
CMOR Technical Reports