A branch and bound algorithm for the multiple depot vehicle scheduling problem

This publication has 7 references indexed in Scilit:

• An Additive Bounding Procedure for Combinatorial Optimization Problems
  Operations Research, 1989
• A new dominance procedure for combinatorial optimization problems
  Operations Research Letters, 1988
• On some matching problems arising in vehicle scheduling models
  Networks, 1987
• Network models for vehicle and crew scheduling
  European Journal of Operational Research, 1984
• Routing and scheduling of vehicles and crews
  Computers & Operations Research, 1983
• Classification in vehicle routing and scheduling
  Networks, 1981
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
  Management Science, 1980