The Numerical Solution of Network Problems Using the Out-of-Kilter Algorithm

by R. J. Clasen


Full Document

FormatFile SizeNotes
PDF file 1.5 MB

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


Purchase Print Copy

 FormatList Price Price
Add to Cart Paperback67 pages $25.00 $20.00 20% Web Discount

An explanation of the Fulkerson network flow algorithm (P-1825) to provide practical guidance in applying it to computational problems. The Memorandum is divided into four substantially independent sections that (1) review the types of problems that can be represented as capacitated network problems; (2) explain (with diagrams) the out-of-kilter algorithm and techniques for implementing it on a computer; (3) describe modification to a two-phase algorithm; and (4) present a method for labeling the nodes by means of a scan list.It is tentatively concluded that the two-phase algorithm is undesirable and that the list structure procedure shortens computer time at the cost of using more memory. A 1530-arc problem on the IBM-360 Model 40 ran five times as fast using the list structures — 30 minutes, as compared with 2.5 hours for the searching technique.

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.