12 search results - page 1 / 3 » On Application of Ant Algorithms to Non-bifurcated Multicomm... |
ICAISC
2004
Springer
14 years 6 days ago
2004
Springer
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...
MOR
2000
13 years 6 months ago
2000
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...
IPL
2006
13 years 6 months ago
2006
We study an NP-hard (and MaxSNP-hard) problem in trees--Multicommodity Demand Flow--dealing with demand flows between pairs of nodes and trying to maximize the value of the routed...
OR
2004
Springer
14 years 5 days ago
2004
Springer
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...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...