Computation of maximal flows in networks

D. R. Fulkerson and G. B. Dantzig

Naval Research Logistics Quarterly, 1955, vol. 2, issue 4, 277-283

Abstract: A simple computational method, based on the simplex algorithm of linear programming, is proposed for the following problem: “Consider a network (e.g., rail, road, communication network) connecting two given points by way of a number of intermediate points, 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 point to the other.”

Date: 1955
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800020407

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:2:y:1955:i:4:p:277-283

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().