OPTIMAL INTERDICTION OF A SUPPLY NETWORK
OPTIMAL INTERDICTION OF A SUPPLY NETWORK
复制标题
DOI：
10.1002/nav.3800170302
复制
发表时间：
1970-01-01
期刊：
影响因子：
--
通讯作者：
MUSTIN, TM
中科院分区：
文献类型：
--
作者：
MCMASTERS, AW;MUSTIN, TM
在某些条件下，战斗部队的再补给能力可能会受到补给必须流经的运输网络的特点的限制。敌对势力的封锁可能被用来降低该网络的容量。这种努力的效果因任务和目标的不同而不同。由于可用总预算有限，中断者必须决定打击哪些目标，以及付出多少努力。给出了当弧上最小容量为正值，且阻塞费用是弧容量减少量的线性函数时，以最小化网络流量为目标的最优阻塞方案的确定算法。
Under certain conditions, the re‐supply capability of a combatant force may be limited by the characteristics of the transportation network over which supplies must flow. Interdiction by an opposing force may be used to reduce the capacity of that network. The effects of such efforts vary for differing missions and targets. With only a limited total budget available, the interdictor must decide which targets to hit, and with how much effort. An algorithm is presented for determining the optimum interdiction plan for minimizing network flow capacity when the minimum capacity on an arc is positive and the cost of interdiction is a linear function of arc capacity reduction.