An Analysis of Several Heuristics for the Traveling Salesman Problem


Several polynomial time algorithms finding “good,” but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the obtained tour length to the minimal tour length. For the nearest neighbor method, we show the ratio is bounded above by a logarithmic function of the number of nodes… (More)
DOI: 10.1137/0206041


5 Figures and Tables


Citations per Year

348 Citations

Semantic Scholar estimates that this publication has 348 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics