A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One

DOI10.1137/0211003zbMath0479.90079OpenAlexW2055038236MaRDI QIDQ3937162

Routo Terada, John H. Halton

Publication date: 1982

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/58242

zbMATH Keywords

traveling salesman problemprobabilistic algorithmminimal tour length

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05)

Related Items (9)

Maximal paths in random dynamic graphs ⋮ On properties of geometric random problems in the plane ⋮ Quantizers ad the worst case Euclidean traveling salesman problem ⋮ Continuous approximation models in freight distribution management ⋮ An appraisal of computational complexity for operations researchers ⋮ A new iterative Monte Carlo approach for inverse matrix problem ⋮ A partitioning algorithm for minimum weighted Euclidean matching ⋮ A useful transform of standard input data for a classical NP-complete problem ⋮ Partitioning heuristics for two geometric maximization problems

This page was built for publication: A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One