arXiv · cond-mat/0106429
The Euclidean travelling salesman problem: Frequency distribution of neighbours for small-size systems
Abstract
We have studied numerically the frequency distribution $ρ(n)$ of the n-th neighbour along the optimal tour in the Euclidean travelling salesman problem for N cities, in dimensions d=2 and d=3. We find there is no significant dependence of $ρ(n)$ on either the number of cities N or the dimension d.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Anirban Chakraborti. 2001-06-21. The Euclidean travelling salesman problem: Frequency distribution of neighbours for small-size systems. https://doi.org/10.1142/s0129183101002048
Cite the original work for its findings. Save a collection to share your selection of sources.