Algorithms for Targeting Strikes in a Lines-of-Communication (LOC) Network

by Richard D. Wollmer


Full Document

FormatFile SizeNotes
PDF file 0.7 MB

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


Purchase Print Copy

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

Two algorithms for targeting strikes in a lines-of-communication (LOC) network. Assuming that the LOC user attempts to achieve a circulation flow at minimum cost, algorithms aim at making such costs as large as possible over time. The effect of targeting strikes is to increase the arc cost functions and decrease the capacities. The strike value of a particular arc is found by calculating a minimum-cost circulation flow and its cost — first, when all arcs are assigned unstruck costs and capacities, and second when struck values are assigned to arcs under consideration — and then performing the indicated arithmetic. Whether it be a case where arc costs are linear functions of flow, or convex-piecewise-linear functions of flow with one break-point, optimal arc selection is approximated by repeated application of the one-strike algorithm.

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.