Sciweavers

407 search results - page 42 / 82
» Recursive or iterative routing
Sort
View
HEURISTICS
2010
15 years 3 months ago
An adaptive memory algorithm for the split delivery vehicle routing problem
Abstract The split delivery vehicle routing problem (SDVRP) relaxes routing restrictions forcing unique deliveries to customers and allows multiple vehicles to satisfy customer dem...
Rafael E. Aleman, Xinhui Zhang, Raymond R. Hill
INFOCOM
2009
IEEE
16 years 16 days ago
Minimizing End-to-End Delay: A Novel Routing Metric for Multi-Radio Wireless Mesh Networks
—This paper studies how to select a path with the minimum cost in terms of expected end-to-end delay (EED) in a multi-radio wireless mesh network. Different from the previous eff...
Hongkun Li, Yu Cheng, Chi Zhou, Weihua Zhuang
INFOCOM
1995
IEEE
15 years 9 months ago
Complexity of Gradient Projection Method for Optimal Routing in Data Networks
—In this paper, we derive a time-complexity bound for the gradient projection method for optimal routing in data networks. This result shows that the gradient projection algorith...
Wei Kang Tsai, John K. Antonio, Garng M. Huang
EOR
2007
78views more  EOR 2007»
15 years 5 months ago
A Lagrangean relaxation and decomposition algorithm for the video placement and routing problem
Video on Demand (VoD) is a technology used to provide a number of programs to a number of users on request. In developing a VoD system, a fundamental problem is load balancing, wh...
Tolga Bektas, Osman Oguz, Iradj Ouveysi
TAPAS
2011
286views Algorithms» more  TAPAS 2011»
15 years 25 days ago
Alternative Route Graphs in Road Networks
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...
Roland Bader, Jonathan Dees, Robert Geisberger, Pe...