Finding Tours in the TSP
The 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.
Citable link to this pagehttps://hdl.handle.net/1911/101911
MetadataShow full item record
- CAAM Technical Reports