A Countercapacity Network Interdiction Model

Robert L. Helmbold

ResearchPublished 1971

A mathematical model is developed for countercapacity interdiction problems involving the allocation of a limited amount of resources, such as air strikes, among the arcs of a supply network so as to minimize the network flow capacity. For source-sink planar networks, it is possible to construct and solve a closely related dual problem, and then to interpret the dual solution in terms of the original network. A computer program implementing a restricted special case of the solution is included, with examples of its use in solving countercapacity interdiction problems. Extensions of the method to other than source-sink planar networks are discussed. (See also RM-5864, RM-6065.)

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1971
  • Pages: 50
  • Document Number: R-611-PR

Citation

Chicago Manual of Style

Helmbold, Robert L., A Countercapacity Network Interdiction Model. Santa Monica, CA: RAND Corporation, 1971. https://www.rand.org/pubs/reports/R0611.html.
BibTeX RIS

This publication is part of the RAND report series. The report series, a product of RAND from 1948 to 1993, represented the principal publication documenting and transmitting RAND's major research findings and final research.

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.