86 search results - page 1 / 18 » Approximations for minimum and min-max vehicle routing probl... |
INFORMS
2002
13 years 4 months ago
2002
COCOON
2006
Springer
13 years 8 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...
JAL
2006
13 years 4 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
In the capacitated vehicle routing problem, introduced by Dantzig and Ramser in 1959, we are given the locations of n customers and a depot, along with a vehicle of capacity k, an...
ESA
2009
Springer
13 years 11 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...