Title of article :
A note on optimal algorithms for reserve site selection
Author/Authors :
Jeffrey D. Camm، نويسنده , , Stephen Polasky، نويسنده , , Andrew Solow، نويسنده , , Blair Csuti، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 1996
Pages :
3
From page :
353
To page :
355
Abstract :
A recent note by Underhill (Biol. Conserv., 70, 85-7, 1994) points out the need for the use of optimization models and a closer working relationship with mathematicians for the solution of biological management problems such as the reserve site selection problem. In this note we give the mathematical formulation of what he terms ‘the more realistic’ version of the reserve selection problem, namely, the problem of maximizing the number of species preserved given a fixed budget for reserve sites. We also discuss some straight-forward data reduction schemes which may reduce the solution time for these problems when they are solved using general off-the-shelf optimization code as mentioned by Underhill.
Keywords :
reserve site selection , integer programming , maximal coverage problem
Journal title :
Biological Conservation
Serial Year :
1996
Journal title :
Biological Conservation
Record number :
835399
Link To Document :
بازگشت