期刊
OPERATIONS RESEARCH LETTERS
卷 44, 期 1, 页码 114-120出版社
ELSEVIER
DOI: 10.1016/j.orl.2015.11.005
关键词
Network flows; Interdiction; Game theory; Approximation
In this paper, we introduce the randomized network interdiction problem that allows the interdictor to use randomness to select arcs to be removed. We model the problem in two different ways: arc-based and path-based formulations, depending on whether flows are defined on arcs or paths, respectively. We present insights into the modeling power, complexity, and approximability of both formulations. (C) 2015 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据