The Numerical Solution of Network Problems Using the Out-of-Kilter Algorithm
ResearchPublished 1968
ResearchPublished 1968
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 publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included 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.
RAND 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.