Maximal Flow Through a Network

L. R. Ford Jr.; D. R. Fulkerson

doi:10.4153/CJM-1956-045-5

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.”

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

Crossref Citations

This article has been cited by the following publications. This list is generated based on data provided by Crossref.

Ford, L. R. and Fulkerson, D. R. 1957. A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem. Canadian Journal of Mathematics, Vol. 9, Issue. , p. 210.

Gallai, T. 1958. Maximum-Minimum Sätze über Graphen. Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 9, Issue. 3-4, p. 395.

1959. Matrix Games, Programming, and Mathematical Economics. p. 415.

1959. The Theory of Infinite Games. p. 371.

Harary, F. 1959. Graph theory and electric networks. IEEE Transactions on Information Theory, Vol. 5, Issue. 5, p. 95.

Fulkerson, D. R. 1959. A Network-Flow Feasibility Theorem and Combinatorial Applications. Canadian Journal of Mathematics, Vol. 11, Issue. , p. 440.

Gallai, T. 1959. Über reguläre Kettengruppen. Acta Mathematica Academiae Scientiarum Hungaricae, Vol. 10, Issue. 1-2, p. 227.

Harary, F. 1959. Graph Theory and Electric Networks. IRE Transactions on Circuit Theory, Vol. 6, Issue. 5, p. 95.

Mayeda, W. 1960. Terminal and Branch Capacity Matrices of a Communication Net. IRE Transactions on Circuit Theory, Vol. 7, Issue. 3, p. 261.

Wing, O. 1961. Algorithms to Find the Most Reliable Path in a Network. IRE Transactions on Circuit Theory, Vol. 8, Issue. 1, p. 78.

Fulkerson, D. R. 1961. An Out-of-Kilter Method for Minimal-Cost Flow Problems. Journal of the Society for Industrial and Applied Mathematics, Vol. 9, Issue. 1, p. 18.

Tang, D. and Chien, R. 1961. Analysis and Synthesis Techniques of Oriented Communication Nets. IRE Transactions on Circuit Theory, Vol. 8, Issue. 1, p. 39.

Kelley, J. E. 1961. Techniques for storage allocation algorithms. Communications of the ACM, Vol. 4, Issue. 10, p. 449.

Lee, C. Y. 1961. An Algorithm for Path Connections and Its Applications. IEEE Transactions on Electronic Computers, Vol. EC-10, Issue. 3, p. 346.

Wing, O. and Chien, R. 1961. Optimal Synthesis of a Communication Net. IRE Transactions on Circuit Theory, Vol. 8, Issue. 1, p. 44.

Gomory, R. E. and Hu, T. C. 1961. Multi-Terminal Network Flows. Journal of the Society for Industrial and Applied Mathematics, Vol. 9, Issue. 4, p. 551.

Hakimi, S. 1962. Simultaneous Flows Through a Communication Network. IRE Transactions on Circuit Theory, Vol. 9, Issue. 2, p. 169.

Duffin, R.J. 1962. The extremal length of a network. Journal of Mathematical Analysis and Applications, Vol. 5, Issue. 2, p. 200.

Tang, D. 1962. Communication Networks with Simultaneous Flow Requirements. IRE Transactions on Circuit Theory, Vol. 9, Issue. 2, p. 176.

Yau, S. 1962. Synthesis of Radio-Communication Nets. IRE Transactions on Circuit Theory, Vol. 9, Issue. 1, p. 62.

Download full list

Article contents

Maximal Flow Through a Network

Extract

Information

References

Save article to Kindle

Save article to Dropbox

Save article to Google Drive

Reply to: Submit a response

Your details

You have entered the maximum number of contributors

Conflicting interests