Sciweavers

55 search results - page 2 / 11
» A Specialized Interior-Point Algorithm for Multicommodity Ne...
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
14 years 5 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
MOR
2000
162views more  MOR 2000»
13 years 5 months ago
Approximation Algorithms for Disjoint Paths and Related Routing and Packing Problems
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
Alok Baveja, Aravind Srinivasan
OR
2004
Springer
13 years 10 months ago
Freight Flow Consolidation in Presence of Time Windows
This contribution addresses the consideration of time windows in the optimization of multi-commodity network flows. For each node, one interval is specified in which the visitati...
Jörn Schönberger, Herbert Kopfer
ICAISC
2004
Springer
13 years 10 months ago
On Application of Ant Algorithms to Non-bifurcated Multicommodity Flow Problem
Our discussion in this article centers on the application of ant algorithms to the non-bifurcated multicommodity flow problem. We propose a general framework of ant algorithm that...
Krzysztof Walkowiak
NETWORKING
2004
13 years 6 months ago
A New Method of Primary Routes Selection for Local Restoration
We consider the problem of non-bifurcated multicommodity flows rerouting in survivable connection-oriented networks. We focus on local restoration, in which the backup route is rer...
Krzysztof Walkowiak