Vehicle Routing Problem with Time Windows

This publication has 23 references indexed in Scilit:

• Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem
  Networks, 2003
• A Branch-and-Cut Procedure for the Vehicle Routing Problem with Time Windows
  Transportation Science, 2002
• Accelerating Strategies in Column Generation Methods for Vehicle Routing and Crew Scheduling Problems
  2002
• 7. VRP with Time Windows
  2002
• Solving the Asymmetric Travelling Salesman Problem with time windows by branch-and-cut
  Mathematical Programming, 2001
• A polyhedral study of the asymmetric traveling salesman problem with time windows
  Networks, 2000
• Note on the Complexity of the Shortest Path Models for Column Generation in VRPTW
  Operations Research, 1994
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
  Operations Research, 1992
• Lagrangian Relaxation Methods for Solving the Minimum Fleet Size Multiple Traveling Salesman Problem with Time Windows
  Management Science, 1988
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
  Management Science, 1980