期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 283, 期 3, 页码 797-811出版社
ELSEVIER
DOI: 10.1016/j.ejor.2019.06.024
关键词
Networks; Network interdiction; Min-max games; Mixed integer programming formulations; Decomposition algorithms
This paper discusses the development of interdiction optimization models and algorithms, with an emphasis on mathematical programming techniques and future research challenges in the field. After presenting basic interdiction concepts and notation, we recount the motivation and models behind founding research in the network interdiction field. Next, we examine some of the most common means of solving interdiction problems, focusing on dualization models and extended formulations solvable by row-generation techniques. We then examine contemporary interdiction problems involving incomplete information, information asymmetry, stochasticity, and dynamic play. We conclude by discussing several emerging applications in the field of network interdiction. (C) 2019 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据