Further results on the probabilistic traveling salesman problem

This publication has 14 references indexed in Scilit:

• The probabilistic minimum spanning tree problem
  Networks, 1990
• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
  Operations Research Letters, 1989
• Realising wreath products of cyclic groups as Galois groups
  Mathematika, 1988
• A Minimal Technology Routing System for Meals on Wheels
  Interfaces, 1983
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
  Operations Research Letters, 1982
• Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability
  The Annals of Probability, 1981
• An Analysis of Several Heuristics for the Traveling Salesman Problem
  SIAM Journal on Computing, 1977
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  Mathematics of Operations Research, 1977
• The traveling-salesman problem and minimum spanning trees: Part II
  Mathematical Programming, 1971
• Computer Solutions of the Traveling Salesman Problem
  Bell System Technical Journal, 1965