Reliable Network Interdiction Models with Multiple Unit Costs

Mathematical and Computational Applications

Zhao, Jia¹ 

关键词: bilevel program;    dual program;    shortest path problems;    NP-completeness;    knapsack problem;   

DOI  :  10.3390/mca21040050

学科分类：计算数学

来源: mdpi

【 摘 要 】

This paper proposes a reliable network interdiction model with multiple unit costs, which maximizes the minimum arrival cost of the invader to the sink by setting obstacles on some arcs with limited resources in the given network. In other words, given a graph with a source and a sink, several arcs will be selected with limited resources such that each path contains as many weights as possible. This model needs to be transferred into a bilevel program because its constraints can hardly be listed explicitly even for a graph with a moderate size, because the number of paths between any two given points increases exponentially according to the size of the graph. This bilevel model is equivalent to an integer model with a low degree number of constraints by converting the inner programming to a shortest path problem. We first prove that this problem is non-deterministic polynomial-time (NP)-hard. Secondly, we reduce the number of constraints to the first power from the exponential degree by using the dual technique. Lastly, the national railway network is used to show the feasibility of our method.

【 授权许可】

CC BY