448 search results - page 8 / 90 » Fast Approximation Algorithms for Multicommodity Flow Proble... |
ICCSA
2005
Springer
14 years 2 months ago
2005
Springer
The major objective of this paper is to deploy an effective evolutionary algorithm (EA) for the congestion problem in connection-oriented networks. The network flow is modeled as n...
NETWORKING
2004
13 years 10 months ago
2004
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...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
We study several multi-criteria undirected network design problems with node costs and lengths. All these problems are related to the Multicommodity Buy at Bulk (MBB) problem in w...
MP
1998
13 years 8 months ago
1998
Consider a directed graph G = (V;A), and a set of tra c demands to be shipped between pairs of nodes in V. Capacity has to be installed on the edges of this graph (in integer mult...
MIDDLEWARE
2007
Springer
14 years 2 months ago
2007
Springer
In this paper we consider the problem of maximising utility in linked market-driven distributed and Grid systems. In such systems, users submit jobs through brokers who can virtua...