Sciweavers

Share
DISOPT
2006

Improved bounds for vehicle routing solutions

11 years 1 months ago
Improved bounds for vehicle routing solutions
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
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where DISOPT
Authors Agustín Bompadre, Moshe Dror, James B. Orlin
Comments (0)
books