Notes on Linear Programming
Part XX Maximal Flow Through a Network
Download Free Electronic Document
|PDF file||1.3 MB||
Use Adobe Acrobat Reader version 10 or higher for the best experience.
Purchase Print Copy
|Add to Cart||Paperback12 pages||$20.00||$16.00 20% Web Discount|
A proof of the minimal cut theorem, for a general network, which determines a simple computational procedure for achieving a maximal flow in planar networks.
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.
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 www.rand.org/pubs/permissions.
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.