On the power of randomization in network interdiction
Name
Orlin_On the power of Randomization.pdf
Size
128.01 KB
Format
Adobe PDF
Checksum (MD5)
01acf2e6aff7d5c0456321c57115799e
Author(s)
Bertsimas, Dimitris J
Nasrabadi, Ebrahim
Orlin, James B
Date Issued
December 2015
Journal
Operations Research Letters
Publisher
Elsevier
Citation
Bertsimas, Dimitris et al. “On the Power of Randomization in Network Interdiction.” Operations Research Letters 44, 1 (January 2016): 114–120 © 2015 Elsevier B.V.
Version
Author's final manuscript
Abstract
In this paper, we introduce the randomized network interdiction problem that allows the interdictor to use randomness to select arcs to be removed. We model the problem in two different ways: arc-based and path-based formulations, depending on whether flows are defined on arcs or paths, respectively. We present insights into the modeling power, complexity, and approximability of both formulations. Keywords
Network flows
Interdiction
Game theory
Approximation
MIT Department
Sloan School of Management
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1016/J.ORL.2015.11.005
