Chapter 2 Time constrained routing and scheduling

This publication has 104 references indexed in Scilit:

• Exact Solution of Locomotive Scheduling Problems
  Journal of the Operational Research Society, 1991
• Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
  Operations Research Letters, 1991
• A branch and bound algorithm for the multiple depot vehicle scheduling problem
  Networks, 1989
• On the worst‐case performance of some heuristics for the vehicle routing and scheduling problem with time window constraints
  Networks, 1986
• Local search in routing problems with time windows
  Annals of Operations Research, 1985
• Shortest chain subject to side constraints
  Networks, 1983
• Algorithm 562: Shortest Path Lengths [H]
  ACM Transactions on Mathematical Software, 1980
• Vehicle Scheduling with Timed and Connected Calls: A Case Study
  Journal of the Operational Research Society, 1968
• A computer application to a transport scheduling problem
  The Computer Journal, 1967
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959