| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 1141772 | Discrete Optimization | 2006 | 18 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Control and Optimization
Authors
AgustÃn Bompadre, Moshe Dror, James B. Orlin,