94 search results - page 7 / 19 » Capacity inverse minimum cost flow problem |
ICALP
2003
Springer
14 years 23 days 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 ...
ICC
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract —In this paper, we study the problems of resource allocation and admission control of traffic flows with guaranteed Quality of Service. Specifically, we deal with traffi...
BROADNETS
2007
IEEE
14 years 1 months ago
2007
IEEE
— Traffic engineering has been extensively studied to maximize network resource utilization while minimizing call blocking [1]. As the the demand for high data rate services ove...
INFOCOM
1997
IEEE
13 years 11 months ago
1997
IEEE
—This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The ...
TAMC
2009
Springer
14 years 2 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...