A decomposition algorithm applied to planning the interdiction of stochastic networks

Harald Held, Raymond Hemmecke, David L. Woodruff

Research output: Contribution to journalArticlepeer-review

37 Scopus citations

Abstract

We describe the application of a decomposition based solution method to a class of network interdiction problems. The problem of maximizing the probability of sufficient disruption of the flow of information or goods in a network whose characteristics are not certain is shown to be solved effectively by applying a scenario decomposition method developed by Riis and Schultz [Comput Optim Appl 24 (2003), 267-287]. Computational results demonstrate the effectiveness of the algorithm and design decisions that result in speed improvements.

Original languageEnglish
Pages (from-to)321-328
Number of pages8
JournalNaval Research Logistics
Volume52
Issue number4
DOIs
StatePublished - Jun 2005
Externally publishedYes

Keywords

  • Network interdiction
  • Risk criterion
  • Stochastic programming

Fingerprint

Dive into the research topics of 'A decomposition algorithm applied to planning the interdiction of stochastic networks'. Together they form a unique fingerprint.

Cite this