메뉴 건너뛰기




Volumn 61, Issue 4, 2011, Pages 981-992

A constrained binary knapsack approximation for shortest path network interdiction

Author keywords

Approximation techniques; Homeland security; Integer programming; Network interdiction

Indexed keywords

APPROXIMATION PERFORMANCE; APPROXIMATION TECHNIQUES; COMPUTATION TIME; COMPUTATIONAL EFFORT; DECOMPOSITION METHODS; GEOGRAPHIC REGIONS; HOME LAND SECURITY; MAXIMUM FLOWS; MAXIMUM NETWORKS; NETWORK INTERDICTION; NETWORK INTERDICTION PROBLEMS; NON-DETECTION; OBJECTIVE FUNCTIONS; PROBLEM SIZE; REAL-WORLD NETWORKS; SHORTEST PATH; SPATIAL ANALYSIS;

EID: 80054923943     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2011.06.011     Document Type: Article
Times cited : (20)

References (24)
  • 4
    • 33845439386 scopus 로고    scopus 로고
    • Defending critical infrastructure
    • DOI 10.1287/inte.1060.0252
    • G. Brown, M. Carlyle, J. Salmeron, and K. Wood Defending critical infrastructure Interfaces 36 6 2006 530 544 (Pubitemid 44905062)
    • (2006) Interfaces , vol.36 , Issue.6 , pp. 530-544
    • Brown, G.1    Carlyle, M.2    Salmeron, J.3    Wood, K.4
  • 6
    • 33947208987 scopus 로고    scopus 로고
    • Protecting critical assets: The r-interdiction median problem with fortification
    • DOI 10.1111/j.1538-4632.2007.00698.x
    • R. Church, and M.P. Scaparra Protecting critical assests: The r-interdiction median problem with fortification Geographical Analysis 39 2007 129 146 (Pubitemid 46431805)
    • (2007) Geographical Analysis , vol.39 , Issue.2 , pp. 129-146
    • Church, R.L.1    Scaparra, M.P.2
  • 7
    • 28344448992 scopus 로고
    • Finding the n most vital nodes in a flow network
    • H.W. Corley, and H. Chang Finding the n most vital nodes in a flow network Management Science 21 1974 362 364
    • (1974) Management Science , vol.21 , pp. 362-364
    • Corley, H.W.1    Chang, H.2
  • 9
    • 77954369566 scopus 로고    scopus 로고
    • ESRI Accessed 10.02.10
    • ESRI. (2009). ArcGIS: A complete integrated system. http://www.esri.com/ software/arcgis/index.html. Accessed 10.02.10.
    • (2009) ArcGIS: A Complete Integrated System
  • 12
    • 26644447411 scopus 로고    scopus 로고
    • Heuristics for multi-stage interdiction of stochastic networks
    • DOI 10.1007/s10732-005-3122-y, Supply Chain and Distribution Management
    • H. Held, and D. Woodruff Heuristics for multi-stage interdiction of stochastic networks Journal of Heuristics 11 2005 483 500 (Pubitemid 41442663)
    • (2005) Journal of Heuristics , vol.11 , Issue.5-6 SPEC. ISS. , pp. 483-500
    • Held, H.1    Woodruff, D.L.2
  • 13
    • 0141764679 scopus 로고    scopus 로고
    • Shortest-Path Network Interdiction
    • DOI 10.1002/net.10039
    • E. Israeli, and K. Wood Shortest-path network interdiction Networks 40 2 2002 97 111 (Pubitemid 37218345)
    • (2002) Networks , vol.40 , Issue.2 , pp. 97-111
    • Israeli, E.1    Wood, R.K.2
  • 14
    • 33750618042 scopus 로고    scopus 로고
    • Algorithms for discrete and continuous multicommodity flow network interdiction problems
    • DOI 10.1080/07408170600729192, PII P293574058K08142
    • C. Lim, and J.C. Smith Algorithms for discrete and continuous multicommodity flow network interdiction problems IIE Transactions 39 2007 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
  • 15
    • 85039429121 scopus 로고    scopus 로고
    • Bounding network interdiction vulnerability through cut-set identification
    • Matisziw, T., Murray, A., & Grubesic, T. (2007). Bounding network interdiction vulnerability through cut-set identification. In Advancing spatial science (pp. 243-255).
    • (2007) Advancing Spatial Science , pp. 243-255
    • Matisziw, T.1    Murray, A.2    Grubesic, T.3
  • 18
    • 0009026612 scopus 로고
    • Finding the n most vital links in flow networks
    • H.D. Ratliff, G. Sicilia, and S. Lubore Finding the n most vital links in flow networks Management Science 21 5 1975 539 631
    • (1975) Management Science , vol.21 , Issue.5 , pp. 539-631
    • Ratliff, H.D.1    Sicilia, G.2    Lubore, S.3
  • 19
    • 42549098716 scopus 로고    scopus 로고
    • Solving the bi-objective maximum-flow network-interdiction problem
    • J. Royset, and R.K. Wood Solving the bi-objective maximum-flow network-interdiction problem INFORMS Journal on Computing 19 2 2007 175 184
    • (2007) INFORMS Journal on Computing , vol.19 , Issue.2 , pp. 175-184
    • Royset, J.1    Wood, R.K.2
  • 21
    • 56749128148 scopus 로고    scopus 로고
    • US Census Bureau
    • US Census Bureau. (2008). TIGER/Line and TIGER-related products. < http://www.census.gov/geo/www/tiger/ > Accessed 01.08.08.
    • (2008) TIGER/Line and TIGER-related Products
  • 22
    • 0009075090 scopus 로고
    • Removing arcs from a network
    • R. Wollmer Removing arcs from a network Operations Research 12 1964 934 940
    • (1964) Operations Research , vol.12 , pp. 934-940
    • Wollmer, R.1
  • 23
    • 38249007197 scopus 로고    scopus 로고
    • Deterministic network interdiction
    • R.K. Wood Deterministic network interdiction Mathematical Computer Modeling 17 2 2003 1 18
    • (2003) Mathematical Computer Modeling , vol.17 , Issue.2 , pp. 1-18
    • Wood, R.K.1
  • 24
    • 84857627761 scopus 로고    scopus 로고
    • Role of spatial data in the protection of critical infrastructure and homeland defense
    • Justin Yates, and Irene Casas Role of spatial data in the protection of critical infrastructure and homeland defense Applied Spatial Analysis and Policy 2010 1 18
    • (2010) Applied Spatial Analysis and Policy , pp. 1-18
    • Yates, J.1    Casas, I.2


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