Modern network interdiction problems and algorithms

J. Cole Smith, Mike Prince, Joseph Geunes

Research output: Chapter in Book/Report/Conference proceedingChapter

29 Scopus citations

Abstract

A network interdiction problem usually involves two players who compete in a min-max or max-min game. One player, the network owner, tries to optimize its objective over the network, for example, as measured by a shortest path, maximum flow, or minimum cost flow. The opposing player, called the interdictor, alters the owner's network to maximally impair the owner's objective (e.g., by destroying arcs that maximize the owner's shortest path). This chapter summarizes the impressive recent development of this field. The first part of this chapter emphasizes interdiction foundations, applications, and emerging research areas. The links between this field and business competition models are then developed, followed by a comparison of interdiction research with parallel developments in robust optimization and survivable network design.

Original languageEnglish (US)
Title of host publicationHandbook of Combinatorial Optimization
PublisherSpringer New York
Pages1949-1987
Number of pages39
Volume3-5
ISBN (Electronic)9781441979971
ISBN (Print)9781441979964
DOIs
StatePublished - Jan 1 2013
Externally publishedYes

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Modern network interdiction problems and algorithms'. Together they form a unique fingerprint.

  • Cite this

    Smith, J. C., Prince, M., & Geunes, J. (2013). Modern network interdiction problems and algorithms. In Handbook of Combinatorial Optimization (Vol. 3-5, pp. 1949-1987). Springer New York. https://doi.org/10.1007/978-1-4419-7997-1_61