메뉴 건너뛰기




Volumn 78, Issue 3, 1996, Pages 353-355

A note on optimal algorithms for reserve site selection

Author keywords

integer programming; maximal coverage problem; reserve site selection

Indexed keywords


EID: 0030470886     PISSN: 00063207     EISSN: None     Source Type: Journal    
DOI: 10.1016/0006-3207(95)00132-8     Document Type: Article
Times cited : (152)

References (10)
  • 1
    • 0027041989 scopus 로고
    • A new approach for selecting fully representative reserve networks: Addressing efficiency, reserve design and land suitability with an iterative analysis
    • Bedward, M., Pressey, R. L. and Keith, D. A. (1992). A new approach for selecting fully representative reserve networks: addressing efficiency, reserve design and land suitability with an iterative analysis. Biol. Conserv., 62, 115-25.
    • (1992) Biol. Conserv. , vol.62 , pp. 115-125
    • Bedward, M.1    Pressey, R.L.2    Keith, D.A.3
  • 2
    • 0011374656 scopus 로고
    • Working Paper QA-1994-005, Department of Quantitative Analysis and Operations Management, University of Cincinnati
    • Camm, J. D. and Sweeney, D. J. (1994). Row reduction in the maximal set covering problem. Working Paper QA-1994-005, Department of Quantitative Analysis and Operations Management, University of Cincinnati.
    • (1994) Row Reduction in the Maximal Set Covering Problem
    • Camm, J.D.1    Sweeney, D.J.2
  • 4
    • 0029668262 scopus 로고    scopus 로고
    • Reserve selection as a maximal covering location problem
    • Church, R. L., Stoms, D. M. & Davis, F. W. (1996). Reserve selection as a maximal covering location problem. Biol. Conserv., 76, 105-12.
    • (1996) Biol. Conserv. , vol.76 , pp. 105-112
    • Church, R.L.1    Stoms, D.M.2    Davis, F.W.3
  • 5
    • 85030290790 scopus 로고
    • Working Paper QA-1993-002A, Department of Quantitative Analysis and Operations Management, University of Cincinnati
    • Downs, B. T. and Camm, J. D. (1994). An exact algorithm for the maximal set covering problem. Working Paper QA-1993-002A, Department of Quantitative Analysis and Operations Management, University of Cincinnati.
    • (1994) An Exact Algorithm for the Maximal Set Covering Problem
    • Downs, B.T.1    Camm, J.D.2
  • 6
    • 0000554525 scopus 로고
    • Optimal solution of set covering/partitioning problems using dual heuristics
    • Fisher, M. L. and Kedia, P. (1990). Optimal solution of set covering/partitioning problems using dual heuristics. Management Science, 36(6), 674-88.
    • (1990) Management Science , vol.36 , Issue.6 , pp. 674-688
    • Fisher, M.L.1    Kedia, P.2
  • 7
    • 45549113281 scopus 로고
    • Selecting networks of reserves to maximize biological diversity
    • Margules, C. R., Nicholls, A. O. and Pressey, R. L. (1988). Selecting networks of reserves to maximize biological diversity. Biol. Conserv., 43, 63-76.
    • (1988) Biol. Conserv. , vol.43 , pp. 63-76
    • Margules, C.R.1    Nicholls, A.O.2    Pressey, R.L.3
  • 10
    • 0028133927 scopus 로고
    • Optimal and suboptimal reserve selection algorithms
    • Underhill, L. G. (1994). Optimal and suboptimal reserve selection algorithms. Biol. Conserv., 70, 85-7.
    • (1994) Biol. Conserv. , vol.70 , pp. 85-87
    • Underhill, L.G.1


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