Results 151 to 160 of about 381 (184)

Multicommodity Demand Flow in a Tree

2003
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 profit wf which is obtained if the request is satisfied. The objective is to find a set of demands that can be feasibly routed in the tree and which provide a maximum profit ...
Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd   +2 more
openaire   +1 more source

On multicommodity flows in planar graphs

Networks, 1984
AbstractOkamura and Seymour recently proved two properties of multicommodity flows in undirected planar networks where all the sources and the sinks are on a common face of the underlying graph. One is that a feasible solution is guaranteed whenever each cut's capacity is at least as large as the cut's demand.
openaire   +1 more source

Multicommodity Flows

, 2011
Balachandran Vaidyanathan, Ravindra K. Ahuja   +1 more
exaly   +2 more sources

Multicommodity flows in simple multistage networks

Networks, 1995
AbstractIn this paper, we consider the integral multicommodity flow problem on directed graphs underlying two classes of multistage interconnection networks. In one direction, we consider three‐stage networks. Using existing results on (g, f)‐factors of bipartite graphs, we show sufficient and necessary conditions for the existence of a solution when ...
Ehab S. Elmallah, Joseph C. Culberson
openaire   +2 more sources

Multicommodity Flows in Even, Planar Networks

Algorithmica, 1993
We consider the problem of finding an integral multicommodity flow in a planar, undirected graph where all sources and all targets are on the boundary of the infinite face. Moreover, all capacities and all demands satisfy the so-called evenness condition.
openaire   +1 more source

Multicommodity Network Flows with Probabilistic Losses

Management Science, 1982
This paper considers the problem of maximizing the expected value of multicommodity flows in a network in which the arcs experience probabilistic loss rates. Consideration of probabilistic losses are relevant, particularly, in communication and transportation networks. An arc-chain formulation of the problem and an efficient algorithm for computing an
Y. P. Aneja, K. P. K. Nair
openaire   +2 more sources

Algorithms for multicommodity flows in planar graphs

Algorithmica, 1989
This paper gives efficient algorithms for two classes \(C_{12}\) and \(C_{01}\) of planar undirected graphs. Every graph in \(C_{12}\) has two face boundaries \(B_ 1\) and \(B_ 2\) such that each of the source-sink pairs lies on \(B_ 1\) or \(B_ 2\). On the other hand, every graph in \(C_{01}\) has a face boundary \(B_ 1\) such that some of the source ...
Hitoshi Suzuki, Takao Nishizeki, Nobuji Saito   +2 more
openaire   +2 more sources

Multicommodity Network Flows

2000
One of the assumptions in the previous chapters was that the flow units sent through the network under consideration were all of the same commodity. In this chapter, we drop this assumption. Clearly, doing so requires assurance that the inflow equals the outflow at all nodes for each commodity separately.
H. A. Eiselt, C.-L. Sandblom
openaire   +1 more source

Multicommodity flow problem

Journal of Soviet Mathematics, 1993
The problem of nonmixing multicommodity flow is investigated. The theorem on the number of nonmixing flows of different commodities passing simultaneously through an oriented network is proved.
openaire   +1 more source

Advances in Solving the Multicommodity-Flow Problem

Interfaces, 1998
The multicommodity-flow problem arises in a wide variety of important applications. Many communications, logistics, manufacturing, and transportation problems can be formulated as large multicommodity-flow problems. During the last few years researchers have made steady advances in solving extremely large multicommodity-flow problems. This improvement
openaire   +1 more source