Optimal TSP tour length estimation using Sammon maps
From MaRDI portal
Recommendations
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Optimal TSP tour length estimation using standard deviation as a predictor
- A distribution-free TSP tour length estimation model for random graphs
- On estimating the distribution of optimal traveling salesman tour lengths using heuristics
- A two-dimensional mapping for the traveling salesman problem
Cites work
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- scientific article; zbMATH DE number 3193293 (Why is no real title available?)
- Operational estimators for the length of a traveling salesman tour
- Scikit-learn: machine learning in Python
- Some applications of the clustered travelling salesman problem
Cited in
(8)- Operational estimators for the length of a traveling salesman tour
- Estimating the length of the optimal TSP tour: An empirical study using regression and neural networks
- Optimal TSP tour length estimation using standard deviation as a predictor
- A distribution-free TSP tour length estimation model for random graphs
- Ordered spatial sampling by means of the traveling salesman problem
- Models to estimate average route lengths in different geographical environments
- Pseudogeometric version of the traveling salesman problem, its application in quantum physics models and some heuristic algorithms for its solution
- Optimization of the vehicle soft-routing model: effect of the route third dimension on the transportation costs and travelled route shape
This page was built for publication: Optimal TSP tour length estimation using Sammon maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2679001)
