A problem in network interdiction
暂无分享,去创建一个
Suppose we are given a network G=(V,E) with arc distances and a linear cost function for lengthening arcs. In this note, we consider a network-interdiction problem in which the shortest path from source node s to sink node t is to be increased to at least τ units via a least-cost investment strategy. This problem is shown to reduce to a simple minimum-cost-flow problem. Applications and generalizations are discussed, including the multiple-destination case.
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Fred W. Glover,et al. An improved version of the out-of-kilter method and a comparative study of computer codes , 1974, Math. Program..
[3] Richard S. Hatch. Technical Note - Bench Marks Comparing Transportation Codes based on Primal Simplex and Primal-Dual Algorithms , 1975, Oper. Res..
[4] Delbert Ray Fulkerson,et al. Maximizing the minimum source-sink path subject to a budget constraint , 1977, Math. Program..