Further results on the probabilistic traveling salesman problem
- 1 February 1993
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 65 (1) , 68-95
- https://doi.org/10.1016/0377-2217(93)90145-d
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The probabilistic minimum spanning tree problemNetworks, 1990
- Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problemOperations Research Letters, 1989
- Realising wreath products of cyclic groups as Galois groupsMathematika, 1988
- A Minimal Technology Routing System for Meals on WheelsInterfaces, 1983
- An O(N log N) planar travelling salesman heuristic based on spacefilling curvesOperations Research Letters, 1982
- Subadditive Euclidean Functionals and Nonlinear Growth in Geometric ProbabilityThe Annals of Probability, 1981
- An Analysis of Several Heuristics for the Traveling Salesman ProblemSIAM Journal on Computing, 1977
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the PlaneMathematics of Operations Research, 1977
- The traveling-salesman problem and minimum spanning trees: Part IIMathematical Programming, 1971
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965