Sciweavers

2343 search results - page 18 / 469
» The Locomotive Routing Problem
Sort
View
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 6 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
BROADNETS
2006
IEEE
13 years 9 months ago
On the Broadcast Storm Problem in Ad hoc Wireless Networks
Routing protocols developed for ad hoc wireless networks use broadcast transmission to either discover a route or disseminate information. More specifically, reactive routing proto...
Ozan K. Tonguz, Nawaporn Wisitpongphan, Jayendra S...
ICDCSW
2005
IEEE
14 years 1 months ago
On Optimal TTL Sequence-Based Route Discovery in MANETs
In on-demand multi-hop routing protocols for MANETs such as DSR and AODV, a fundamental requirement for peer-to-peer connectivity is to discover routes to a remote node via flood...
Dimitrios Koutsonikolas, Saumitra M. Das, Himabind...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 11 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
WSC
2004
13 years 9 months ago
On-Demand Computation of Policy Based Routes for Large-Scale Network Simulation
Routing table storage demands pose a significant obstacle for large-scale network simulation. On-demand computation of routes can alleviate those problems for models that do not r...
Michael Liljenstam, David M. Nicol