12 search results - page 2 / 3 » On Application of Ant Algorithms to Non-bifurcated Multicomm... |
JACM
2007
13 years 5 months ago
2007
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...
MIDDLEWARE
2007
Springer
13 years 11 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...
TAMC
2009
Springer
13 years 11 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...
IPCO
1992
13 years 6 months ago
1992
In this paper we study enumeration problems for polytopes arising from combinatorial optimization problems. While these polytopes turn out to be quickly intractable for enumeration...