The concept of optimum flows is introduced and its properties in a general communication
network where flow suffers loss or gains during transmission through channels are …

This note discusses the problem of maximizing the rate of flow from one terminal to another,
through a network which consists of a number of branches, each of which has a limited …

The main purpose of routing and flow control in a communication network is, roughly
speaking, to keep delay per message (ie travel time from origin to destination) within an …

This paper presents a generalization of the results of Elias, Feinstein, and Shannon, and
Ford and Fulkerson on the maximum rate of information flow through a communciation …

The optimal flow problem in networks with gains is presented through the simplex method.
Out of simple theorical conditions, a method is built which needs only a relatively small …

Optimal flows in networks with multiple sources and sinks Page 1 Mathematical Programming 7
(19 74) 9 7-10 7. North-Holland Publishing Company OPTIMAL FLOWS IN NETWORKS WITH …

This paper uses the special structure at a (directed) acyclic network with positive gains to
develop an extremely simple and powerful algorithm for maximal flow. Finiteness of the …

The maximum fiow problem is one of the fundamental problems in network fiow theory
together wiLh the shortest path problern. And the algQrithms for finding a maximum flow in a …

In a communication network, a multiroute channel is more reliable than is an ordinary
channel against link or terminal failures. An m‐route flow corresponds to a set of m‐route …

The problem discussed in this paper arises naturally in the study of transportation networks.
Roughly stated, it is as follows. Consider a network connecting two nodes by way of a …