期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 65, 期 4, 页码 531-536出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2013.04.014
关键词
Maximum dynamic flow; Network interdiction; Temporally repeated flows; Benders' decomposition; Vital arc
We consider the dynamic version of the maximum flow network interdiction problem; that is, we assume a positive number is assigned to each arc which indicates the traversal time of the flow through that arc. We also assume that an intruder uses a single resource with limited budget to interrupt the flow of a single commodity through the network within a given time limit of T. A new formulation based on the concept of Temporally Repeated Flow (TRF) is presented. The problem is then solved using Benders' decomposition. Another solution method, based on the most vital arcs in a network is also discussed. Finally, some computational results are reported. (C) 2013 Elsevier Ltd. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据