Downloads & Free Reading Options - Results

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.