Exact Algorithms for the Vehicle Routing Problem

This publication has 47 references indexed in Scilit:

• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
  Mathematical Programming, 1981
• Classification in vehicle routing and scheduling
  Networks, 1981
• State‐space relaxation procedures for the computation of bounds to routing problems
  Networks, 1981
• Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem
  Management Science, 1980
• Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
  Management Science, 1980
• Edmonds polytopes and weakly hamiltonian graphs
  Mathematical Programming, 1973
• An Algorithm for the Vehicle-dispatching Problem
  Journal of the Operational Research Society, 1969
• Scheduling of Vehicles from a Central Depot to a Number of Delivery Points
  Operations Research, 1964
• On an Integer Program for a Delivery Problem
  Operations Research, 1964
• Partitioning procedures for solving mixed-variables programming problems
  Numerische Mathematik, 1962