Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-23T19:24:51.138Z Has data issue: false hasContentIssue false
  • English
  • Français

Maximal Flow Through a Network

Published online by Cambridge University Press:  20 November 2018

L. R. Ford Jr.  and
D. R. Fulkerson
L. R. Ford Jr.
Affiliation:
Rand Corporation, Santi Monica, California
D. R. Fulkerson
Affiliation:
Rand Corporation, Santi Monica, California
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Introduction. The problem discussed in this paper was formulated by T. Harris as follows:

“Consider a rail network connecting two cities by way of a number of intermediate cities, where each link of the network has a number assigned to it representing its capacity. Assuming a steady state condition, find a maximal flow from one given city to the other.”

Type
Research Article
Information
Canadian Journal of Mathematics , Volume 8 , 1956 , pp. 399 - 404
Copyright
Copyright © Canadian Mathematical Society 1956

References

1. Dantzig, G. B., Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation (Cowles Commission, 1951).Google Scholar
2. Whitney, H., Non-separable and planar graphs, Trans. Amer. Math. Soc, 34 (1932), 339–362.Google Scholar
3. Whitney, H., Planar graphs, Fundamenta Mathematicae, 21 (1933), 73–84.Google Scholar