Multi-period network interdiction problems with applications to city-level drug enforcement
Authors:
- 1 May 2012
- journal article
- research article
- Published by Taylor & Francis in IIE Transactions
- Vol. 44 (5) , 368-380
Abstract
This article considers a new class of multi-period network interdiction problems that focus on scheduling the activities of law enforcement in order to successfully interdict criminals in an illegal drug supply chain. This class of problems possesses several novel features for interdiction problems that were motivated through collaborations with city-level drug enforcement officials. These features include modeling the temporal aspects of these interdictions and the requirements associated with building interdictions in order to arrest high-ranking criminals in the drug supply chain. Based on these collaborations a systematic procedure is developed to generate realistic test instances of the multi-period network interdiction problem. Computational analysis on these realistic test instances provides some direction to the policies that law enforcement should implement in their interdiction activities.Keywords
This publication has 10 references indexed in Scilit:
- The Maximum Flow Network Interdiction Problem: Valid inequalities, integrality gaps, and approximabilityOperations Research Letters, 2010
- Reformulation and sampling to solve a stochastic network interdiction problemNetworks, 2008
- Algorithms for discrete and continuous multicommodity flow network interdiction problemsIIE Transactions, 2007
- Stochastic Network InterdictionOperations Research, 1998
- Deterministic network interdictionMathematical and Computer Modelling, 1993
- Lifestyles and Law Enforcement1991
- Maximizing the minimum source-sink path subject to a budget constraintMathematical Programming, 1977
- Optimal interdiction policy for a flow networkNaval Research Logistics Quarterly, 1971
- Optimal interdiction of a supply networkNaval Research Logistics Quarterly, 1970
- Removing Arcs from a NetworkOperations Research, 1964