.png){kind=icon}
返回
Maximum dynamic network flow interdiction problem: New formulation and solution procedures
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2013.04.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
Maximum dynamic flow
Network interdiction
Temporally repeated flows
Benders' decomposition
Vital arc
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
分享收藏Cats, Crocodiles, Cattle, and More: Initial Steps Toward Establishing a Chronology of Ancient Egyptian Animal Mummies.png)
Radiocarbon
RadiocarbonIF0
PREAI
分享收藏
查看更多内容