|
|||||
|
|
Scheduling crackdowns on illicit drug markets |
|
| Authors: | Ashich V Naik Alok Baveja Rajan Batta Jonathan P Caulkins |
| Institution: | 1. Department of Computer Science, University of Chicago, Chicago, IL 60637, USA;2. School of Business, Rutgers University, Camden, NJ 08102, USA;3. Department of Industrial Engineering, State University of New York at Buffalo, Buffalo, NY 14260, USA;4. Drug Policy Research Center, RAND, Santa Monica, CA 90407, USA;5. Heinz School of Public Policy and Management, Carnegie Mellon University, Pittsburgh, PA 15213, USA |
| Abstract: | This paper presents an analytical approach for scheduling crackdowns on street-corner drug markets. The crackdown scheduling problem is shown to be NP-complete. We then provide efficient optimal algorithms for several special cases and approximation algorithms for the general case. These results show that the optimal strategy is to give priority to markets that take longer to bring down and which require low levels of post-crackdown maintenance. The results are then extended to incorporate dealer displacement between drug markets. |
| Keywords: | Public policy Modelling Scheduling theory Approximation |
| 本文献已被 ScienceDirect 等数据库收录！ | |