ALGORITHMS FOR TARGETING STRIKES IN A LINES-OF-COMMUNICATION (LOC) NETWORK

Abstract

Two algorithms are presented 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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Feb 01, 1969
Accession Number
AD0687078

Entities

People

  • Richard D. Wollmer

Organizations

  • RAND Corporation

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Combat Forces
  • Interdiction
  • Materials
  • Military Forces (United States)
  • Military Organizations
  • Probability
  • Southeast Asia
  • Targeting
  • Targets
  • United States
  • Warfare

Readers

  • Graph Algorithms and Convex Optimization.
  • Irregular Warfare and Special Operations Cyberspace Operations against Adversarial Threats.