Notes on Linear Programming

Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem

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

Download

Download Free Electronic Document

FormatFile SizeNotes
PDF file 0.8 MB

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

Purchase

Purchase Print Copy

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

A solution for finding a maximal flow and minimal cut in a transportation network in order to determine an efficient computational routine for the Hitchcock distribution problem.

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.

Permission is given to duplicate this electronic document for personal use only, as long as it is unaltered and complete. Copies may not be duplicated for commercial purposes. Unauthorized posting of RAND PDFs to a non-RAND Web site is prohibited. RAND PDFs are protected under copyright law. For information on reprint and linking permissions, please visit the RAND Permissions page.

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.