A formulation of railroad interdiction problems in terms of network theory. It assumes that the opposing force wants to maximize its flow of supplies from given origins to given terminals and that the interdicting force wishes to minimize this flow. If the opposing force has an unlimited number of trains, the interdicting force must attack the link that would most severely curtail the number of trains able to use the railway system; if the enemy has a limited number of trains, the link to be attacked is the one that would force the trains to take the longest routes. Algorithms are given for determining the critical link in both situations, as well as their proof and examples of their use.
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.