Sciweavers

263 search results - page 30 / 53
» On a Labeled Vehicle Routing Problem
Sort
View
ROBOCOMM
2007
IEEE
15 years 6 months ago
Decentralized vehicle routing in a stochastic and dynamic environment with customer impatience
— Consider the following scenario: a spatio-temporal stochastic process generates service requests, localized at points in a bounded region on the plane; these service requests a...
Marco Pavone, Nabhendra Bisnik, Emilio Frazzoli, V...
INFOCOM
2007
IEEE
15 years 6 months ago
On the Routing Problem in Disconnected Vehicular Ad-hoc Networks
Abstract— Vehicular Ad Hoc Wireless Network (VANET) exhibits a bipolar behavior in terms of network topology: fully connected topology with high traffic volume or sparsely conne...
Nawaporn Wisitpongphan, Fan Bai, Priyantha Mudalig...
INFOCOM
2003
IEEE
15 years 5 months ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
ESA
2007
Springer
97views Algorithms» more  ESA 2007»
15 years 6 months ago
To Fill or Not to Fill: The Gas Station Problem
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual co...
Samir Khuller, Azarakhsh Malekian, Julián M...
ESA
2009
Springer
124views Algorithms» more  ESA 2009»
15 years 6 months ago
Minimum Makespan Multi-vehicle Dial-a-Ride
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,...
Inge Li Gørtz, Viswanath Nagarajan, R. Ravi