Highly Influenced
6 Excerpts
An Analysis of Several Heuristics for the Traveling Salesman Problem
- Published 1977 in SIAM J. Comput.
Abstract
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)
Topics
5 Figures and Tables
Statistics
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.