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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.