Heuristics for unequal weight delivery problems with a fixed error guarantee

This publication has 12 references indexed in Scilit:

• A vehicle routing improvement algorithm comparison of a “greedy” and a matching implementation for inventory routing
  Computers & Operations Research, 1986
• Bounds and Heuristics for Capacitated Routing Problems
  Mathematics of Operations Research, 1985
• Route first—Cluster second methods for vehicle routing
  Omega, 1983
• Topological design of centralized computer networks—formulations and algorithms
  Networks, 1982
• Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations
  Mathematical Programming, 1981
• A generalized assignment heuristic for vehicle routing
  Networks, 1981
• An approach for solving a class of transportation scheduling problems
  European Journal of Operational Research, 1979
• Tight bounds for christofides' traveling salesman heuristic
  Mathematical Programming, 1978
• Approximation Algorithms for Some Routing Problems
  SIAM Journal on Computing, 1978
• An Algorithm for the Vehicle-dispatching Problem
  Journal of the Operational Research Society, 1969