On estimating the distribution of optimal traveling salesman tour lengths using heuristics

DOI10.1016/j.ejor.2006.12.066zbMath1146.90506OpenAlexW1983019848MaRDI QIDQ2462111

Udatta S. Palekar, Vikrant Vig

Publication date: 23 November 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.066

zbMATH Keywords

Travelling Salesman Problemtour lengthTSP constant

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items

The probabilistic orienteering problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A parallel tabu search algorithm for large traveling salesman problems
• The Euclidean traveling salesman problem and a space-filling curve
• An effective implementation of the Lin-Kernighan traveling salesman heuristic
• The traveling salesman problem and its variations
• Asymptotic expected performance of some TSP heuristics: An empirical evaluation
• The shortest path and the shortest road through n points
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Interval estimation of a global optimum for large combinatorial problems
• Finite Size and Dimensional Dependence in the Euclidean Traveling Salesman Problem
• How Long Can a Euclidean Traveling Salesman Tour Be?
• A Lower Bound for the Expected Travel Among $m$ Random Points