Related references
Note: Only part of the references are listed.Hard to solve instances of the Euclidean Traveling Salesman Problem
Stefan Hougardy et al.
MATHEMATICAL PROGRAMMING COMPUTATION (2021)
SciPy 1.0: fundamental algorithms for scientific computing in Python
Pauli Virtanen et al.
NATURE METHODS (2020)
Distribution of Distances between Elements in a Compact Set
Solal Lellouche et al.
STATS (2020)
Total distance approximations for routing solutions
D. Nicola et al.
COMPUTERS & OPERATIONS RESEARCH (2019)
An empirical validation and data-driven extension of continuum approximation approaches for urban route distances
Daniel Merchan et al.
NETWORKS (2019)
OSMnx: New methods for acquiring, constructing, analyzing, and visualizing complex street networks
Geoff Boeing
COMPUTERS ENVIRONMENT AND URBAN SYSTEMS (2017)
A distribution-free TSP tour length estimation model for random graphs
Bahar Cavdar et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2015)
Computing the variance of tour costs over the solution space of the TSP in polynomial time
Paul J. Sutcliffe et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2012)
An effective implementation of the Lin-Kernighan traveling salesman heuristic
K Helsgaun
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2000)
Share Paper
