Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands

This publication has 20 references indexed in Scilit:

• PTAS for k-Tour Cover Problem on the Plane for Moderately Large Values of k
  Lecture Notes in Computer Science, 2009
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
  Journal of the ACM, 1998
• A Capacitated Vehicle Routing Problem on a Tree
  Lecture Notes in Computer Science, 1998
• The Traveling Salesman Problem with Distances One and Two
  Mathematics of Operations Research, 1993
• Capacitated Vehicle Routing on Trees
  Operations Research, 1991
• Heuristics for unequal weight delivery problems with a fixed error guarantee
  Operations Research Letters, 1987
• Bounds and Heuristics for Capacitated Routing Problems
  Mathematics of Operations Research, 1985
• Capacitated arc routing problems
  Networks, 1981
• An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs
  Journal of the ACM, 1976
• The Truck Dispatching Problem
  Management Science, 1959