Cover: Construction of maximal dynamic flows in networks.

Construction of maximal dynamic flows in networks.

by L. R. Ford, D. R. Fulkerson


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback12 pages $15.00 $12.00 20% Web Discount

A description of an algorithm for solving the problem of finding a maximal dynamic flow through a network. A network is considered in which each link has associated with it two positive integers. It is assumed that some node of the network is a source for the commodity, another a sink, and the remaining may either transship the commodity immediately on receipt or hold for later shipment.

This report is part of the RAND Corporation Paper series. The paper was a product of the RAND Corporation from 1948 to 2003 that captured speeches, memorials, and derivative research, usually prepared on authors' own time and meant to be the scholarly or scientific contribution of individual authors to their professional fields. Papers were less formal than reports and did not require rigorous peer review.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit

The RAND Corporation is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.