Chapter 3 Stochastic and dynamic networks and routing

This publication has 193 references indexed in Scilit:

• Cube Versus Torus Models and the Euclidean Minimum Spanning Tree Constant
  The Annals of Applied Probability, 1993
• The Minimum Spanning Tree Constant in Geometrical Probability and Under the Independent Model: A Unified Approach
  The Annals of Applied Probability, 1992
• A multiphase approach to the period routing problem
  Networks, 1991
• Worst-case examples for the spacefilling curve heuristic for the Euclidean traveling salesman problem
  Operations Research Letters, 1989
• Network Models for Fleet Management*
  Decision Sciences, 1989
• A computational comparison of algorithms for the inventory routing problem
  Annals of Operations Research, 1985
• An algorithm for the equilibrium assignment problem with random link times
  Networks, 1982
• Multi‐commodities transportation schedules over time
  Networks, 1972
• TRANSPORTATION‐LOCATION‐ALLOCATION PROBLEMS OVER TIME*
  Journal of Regional Science, 1971
• A multi-period truck delivery problem
  Transportation Research, 1967