44 search results - page 3 / 9 » Poly-logarithmic Approximation Algorithms for Directed Vehic... |
SODA
2010
ACM
14 years 4 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...
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. This work deals with the Vehicle Routing Problem with Simultaneous Pickup and Delivery. We propose undirected and directed two-commodity flow formulations, which are bas...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
ESA
2009
Springer
14 years 1 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,...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
The (Euclidean) Vehicle Routing Allocation Problem (VRAP) is a generalization of Euclidean TSP. We do not require that all points lie on the salesman tour. However, points that do ...