On estimating the distribution of optimal traveling salesman tour lengths using heuristics
Authors:
- Vikrant VigVVVikrant Vig
- Udatta S. PalekarUPUdatta S. Palekar
- 1 April 2008
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 186 (1) , 111-119
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An effective implementation of the Lin–Kernighan traveling salesman heuristicEuropean Journal of Operational Research, 2000
- Optimization by multicanonical annealing and the traveling salesman problemPhysical Review E, 1994
- A parallel tabu search algorithm for large traveling salesman problemsDiscrete Applied Mathematics, 1994
- The Cavity Method and the Travelling-Salesman ProblemEurophysics Letters, 1989
- How Long Can a Euclidean Traveling Salesman Tour Be?SIAM Journal on Discrete Mathematics, 1989
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis AlgorithmSIAM Review, 1984
- Combinatorial programming, statistical optimization and the optimal transportation network problemTransportation Research Part B: Methodological, 1982
- Interval estimation of a global optimum for large combinatorial problemsNaval Research Logistics Quarterly, 1979
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- The shortest path and the shortest road through n pointsMathematika, 1955