Maximal Flow Through a Network

Canadian Journal of Mathematics - Tập 8 - Trang 399-404 - 1956
L. R. Ford1, D. R. Fulkerson1
1Rand Corporation, Santi Monica, California

Tóm tắt

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

Từ khóa


Tài liệu tham khảo

10.4064/fm-21-1-73-84

Dantzig, 1951, Maximization of a linear function of variables subject to linear inequalities: Activity analysis of production and allocation, Cowles Commission

10.1090/S0002-9947-1932-1501641-2