Notes on Linear Programming

Part XLI Constructing Maximal Dynamic Flows from Static Flows

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


Download eBook for Free

FormatFile SizeNotes
PDF file 1.8 MB

Use Adobe Acrobat Reader version 10 or higher for the best experience.


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback36 pages $20.00 $16.00 20% Web Discount

An outline of a method for constructing maximal dynamic flow from static flow and a presentation of a simple proof of maximality. It is assumed that for a given network of nodes and arcs (e.g., a railway system) each arc has associated with it two positive integers. These integers consist of a commodity-flow capacity and a commodity-traversal time.

This report is part of the RAND Corporation research memorandum series. The Research Memorandum was a product of the RAND Corporation from 1948 to 1973 that represented working papers meant to report current results of RAND research to appropriate audiences.

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.