We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then utilized in a design of best-to-date approximation algorithms. Key words: Vehicle routing problem, Lower bound, Approximation algorithm
Agustín Bompadre, Moshe Dror, James B. Orli