Algorithms for Targeting Strikes in a Lines-of-Communication Network

Richard D. Wollmer
Additional contact information
Richard D. Wollmer: The Rand Corporation, Santa Monica, California

Operations Research, 1970, vol. 18, issue 3, 497-515

Abstract: This paper presents two algorithms for targeting strikes in a lines-of-communication (LOC) network. The LOCs are represented by a network of nodes and directed arcs. It is assumed that the user of the LOCs is attempting to achieve a circulation flow at minimum cost, a very general goal that includes, as special cases, maximizing flow between two points, meeting required flows between two points at minimum cost, and combinations of these two. The algorithms presented here attempt to make such costs as large as possible over time when the effect of targeting strikes is to increase arc-cost functions and decrease arc capacities for a given period of time. The first algorithm treats the situation where arc costs are linear functions of flow; the second treats the situation where arc costs are piecewise linear functions of flow with one break point.

Date: 1970
References: Add references at CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://dx.doi.org/10.1287/opre.18.3.497 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:18:y:1970:i:3:p:497-515

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().