A survey of network interdiction models and algorithms

•Surveys literature starting from 1950s era military applications.•Covers interdiction problems dealing with asymmetric information and stochasticity.•Focuses on mathematical programming based analyses of interdiction problems. This paper discusses the development of interdiction optimization models...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:European journal of operational research Ročník 283; číslo 3; s. 797 - 811
Hlavní autoři: Smith, J. Cole, Song, Yongjia
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 16.06.2020
Témata:
Decomposition algorithms
Min-max games
Mixed integer programming formulations
Network interdiction
Networks
Networks
Min-max games
Decomposition algorithms
Network interdiction
Mixed integer programming formulations
ISSN:0377-2217, 1872-6860
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:•Surveys literature starting from 1950s era military applications.•Covers interdiction problems dealing with asymmetric information and stochasticity.•Focuses on mathematical programming based analyses of interdiction problems. 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.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2019.06.024