A survey of network interdiction models and algorithms

J. Cole Smith, Yongjia Song

Research output: Contribution to journalReview article

6 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)797-811
Number of pages15
JournalEuropean Journal of Operational Research
Volume283
Issue number3
DOIs
StatePublished - Jun 16 2020
Externally publishedYes

Keywords

  • Decomposition algorithms
  • Min-max games
  • Mixed integer programming formulations
  • Network interdiction
  • Networks

ASJC Scopus subject areas

  • Computer Science(all)
  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Fingerprint Dive into the research topics of 'A survey of network interdiction models and algorithms'. Together they form a unique fingerprint.

  • Cite this