Optimal Defense of Multi-Commodity Networks

Mandell Bellmore and H. Donald Ratliff
Additional contact information
Mandell Bellmore: Johns Hopkins University
H. Donald Ratliff: University of Florida

Management Science, 1971, vol. 18, issue 4-Part-I, B174-B185

Abstract: The determination of an optimal strategy for reinforcing arcs and nodes in a multi-commodity network is discussed. This strategy will maximize the effort required by an attacker to render the network useless. Under certain assumptions this problem is shown to be equivalent to the problem of maximizing the capacity of the minimal multi-commodity disconnecting set for the network. An algorithm for determining an optimal reinforcing strategy under these assumptions is presented, and computational results are discussed.

Date: 1971
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.18.4.B174 (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:ormnsc:v:18:y:1971:i:4-part-i:p:b174-b185

Access Statistics for this article

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