44 search results - page 1 / 9 » Poly-logarithmic Approximation Algorithms for Directed Vehic... |
APPROX
2007
Springer
13 years 11 months ago
2007
Springer
DISOPT
2006
13 years 5 months ago
2006
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...
CIAC
2003
Springer
13 years 9 months ago
2003
Springer
We study vehicle routing problems with constraints on the distance traveled by each vehicle or on the number of vehicles. The objective is to minimize the total distance traveled b...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
APIN
2006
13 years 5 months ago
2006
The Vehicle Routing Problem with Time windows (VRPTW) is an extension of the capacity constrained Vehicle Routing Problem (VRP). The VRPTW is NP-Complete and instances with 100 cus...