메뉴 건너뛰기




Volumn 44, Issue 5, 2012, Pages 368-380

Multi-period network interdiction problems with applications to city-level drug enforcement

Author keywords

drug enforcement; Dynamic network interdiction; maximum flows; policy based analysis; scheduling

Indexed keywords

COMPUTATIONAL ANALYSIS; DRUG ENFORCEMENT; DYNAMIC NETWORK INTERDICTION; ILLEGAL DRUGS; MAXIMUM FLOWS; MULTI-PERIOD; NETWORK INTERDICTION PROBLEMS; POLICY-BASED ANALYSIS; TEMPORAL ASPECTS; TEST INSTANCES;

EID: 84858033248     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/0740817X.2011.602659     Document Type: Article
Times cited : (68)

References (12)
  • 1
    • 70449713287 scopus 로고    scopus 로고
    • The maximum flow network interdiction problem: Valid inequalites, integrality gaps, and approximability
    • Altner, D.S., Ergun, O. and Uhan, N.A. (2010) The maximum flow network interdiction problem: valid inequalites, integrality gaps, and approximability. Operations Research Letters, 38(1), 33-38.
    • (2010) Operations Research Letters , vol.38 , Issue.1 , pp. 33-38
    • Altner, D.S.1    Ergun, O.2    Uhan, N.A.3
  • 2
    • 0032024334 scopus 로고    scopus 로고
    • Stochastic network interdiction
    • Cormican,K.J., Morton,D.P. andWood, R.K. (1998) Stochastic network interdiction. Operations Research, 46(2), 184-197. (Pubitemid 128655394)
    • (1998) Operations Research , vol.46 , Issue.2 , pp. 184-197
    • Cormican, K.J.1    Morton, D.P.2    Wood, R.K.3
  • 3
    • 0000096090 scopus 로고
    • Maximizing minimumsourcesink path subject to a budget constraint
    • Fulkerson,D.R. andHarding,G.C. (1977) Maximizing minimumsourcesink path subject to a budget constraint. Mathematical Programming, 13(1), 116-118.
    • (1977) Mathematical Programming , vol.13 , Issue.1 , pp. 116-118
    • Fulkerson, D.R.1    Harding, G.C.2
  • 5
    • 0347389679 scopus 로고
    • Lifestyles and law enforcement
    • Whynes, D. and Beans, P. (eds.), MacMillan, Basingstoke, UK
    • Gilman, M. and Pearson, G. (1991) Lifestyles and law enforcement, in Policing and Prescribing, Whynes, D. and Beans, P. (eds.), MacMillan, Basingstoke, UK, pp. 95-124.
    • (1991) Policing and Prescribing , pp. 95-124
    • Gilman, M.1    Pearson, G.2
  • 6
    • 55349100212 scopus 로고    scopus 로고
    • Reformulation and sampling to solve a stochastic network interdiction problem
    • Janjarassuk, U. and Linderoth, J. (2008) Reformulation and sampling to solve a stochastic network interdiction problem. Networks, 52(3), 120-132.
    • (2008) Networks , vol.52 , Issue.3 , pp. 120-132
    • Janjarassuk, U.1    Linderoth, J.2
  • 7
    • 33750618042 scopus 로고    scopus 로고
    • Algorithms for discrete and continuous multicommodity flow network interdiction problems
    • DOI 10.1080/07408170600729192, PII P293574058K08142
    • Lim, C. and Smith, J.C. (2007) Algorithms for discrete and continuous multicommodity flow network interdiction problems. IIE Transactions, 39(1), 15-26. (Pubitemid 44688388)
    • (2007) IIE Transactions (Institute of Industrial Engineers) , vol.39 , Issue.1 , pp. 15-26
    • Lim, C.1    Smith, J.C.2
  • 8
    • 0141556069 scopus 로고
    • Optimal interdiction of a supply network
    • McMasters, A.W. and Mustin, T.M. (1970) Optimal interdiction of a supply network. Naval Research Logistics, 17(3), 261-268.
    • (1970) Naval Research Logistics , vol.17 , Issue.3 , pp. 261-268
    • McMasters, A.W.1    Mustin, T.M.2
  • 9
    • 27844497886 scopus 로고    scopus 로고
    • Understanding the structure of a drug trafficking organization: A conversational analysis
    • Natarajan, M. (2000) Understanding the structure of a drug trafficking organization: A conversational analysis. Crime Prevention Studies, 11(1), 273-298.
    • (2000) Crime Prevention Studies , vol.11 , Issue.1 , pp. 273-298
    • Natarajan, M.1
  • 10
    • 17844382217 scopus 로고    scopus 로고
    • U.S. Department of Justice National Drug Intelligence Center
    • U.S. Department of Justice National Drug Intelligence Center. (2008) National Drug Threat Assessment.
    • (2008) National Drug Threat Assessment
  • 11
    • 0009075090 scopus 로고
    • Removing arcs from a network
    • Wollmer, R. (1964) Removing arcs from a network. Operations Research, 12(6), 934-940.
    • (1964) Operations Research , vol.12 , Issue.6 , pp. 934-940
    • Wollmer, R.1
  • 12
    • 38249007197 scopus 로고
    • Deterministic network interdiction
    • Wood, R.K. (1993) Deterministic network interdiction. Mathematical and Computer Modelling, 17(2), 1-18.
    • (1993) Mathematical and Computer Modelling , vol.17 , Issue.2 , pp. 1-18
    • Wood, R.K.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.