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...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research Vol. 283; no. 3; pp. 797 - 811
Main Authors: Smith, J. Cole, Song, Yongjia
Format: Journal Article
Language:English
Published: Elsevier B.V 16.06.2020
Subjects:
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
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:•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