Stochastic and dynamic vehicle routing with general demand and interarrival time distributions

This publication has 11 references indexed in Scilit:

• Stochastic and Dynamic Vehicle Routing in the Euclidean Plane with Multiple Capacitated Vehicles
  Operations Research, 1993
• An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability
  Operations Research Letters, 1990
• Heuristics Based on Spacefilling Curves for Combinatorial Problems in Euclidean Space
  Management Science, 1988
• Bounds and Heuristics for Capacitated Routing Problems
  Mathematics of Operations Research, 1985
• An O(N log N) planar travelling salesman heuristic based on spacefilling curves
  Operations Research Letters, 1982
• Poisson Arrivals See Time Averages
  Operations Research, 1982
• Subadditive Euclidean Functionals and Nonlinear Growth in Geometric Probability
  The Annals of Probability, 1981
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
  Mathematics of Operations Research, 1977
• Multiple channel queues in heavy traffic. I
  Advances in Applied Probability, 1970
• The shortest path through many points
  Mathematical Proceedings of the Cambridge Philosophical Society, 1959