作者: Michael A. Clemens , Charles S. ReVelle , Justin C. Williams
DOI: 10.1016/S0377-2217(98)00157-X
关键词: Core (game theory) 、 Nature reserve 、 Computer science 、 Heuristic (computer science) 、 Greedy algorithm 、 Mathematical optimization 、 Reserve design 、 Integer (computer science)
摘要: The problem of designing a natural area reserve for the preservation species is approached as zero-one integer program. least-cost assemblage parcels sought different numbers whose locales must be included within reserve. itself designed to include core and buffer which surround protect core. Compactness contiguity are promoted by formulation. Solution combination greedy heuristic followed concentration achieves reduced set variables