Improved bounds for vehicle routing solutions

Improved bounds for vehicle routing solutions

0.00 Avg rating0 Votes
Article ID: iaor20071231
Country: Netherlands
Volume: 3
Issue: 4
Start Page Number: 299
End Page Number: 316
Publication Date: Dec 2006
Journal: Discrete Optimization
Authors: , ,
Abstract:

We present lower bounds for the vehicle routing problem 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.

Reviews

Required fields are marked *. Your email address will not be published.