Novel operations research methods for efficiently determining irreplaceable sites for conservation

摘要

We examine the irreplaceability of sites in the context of the species set covering problem and the maximal covering species problem. We show that a succession of 0-1 programming problems can be solved to quickly determine the set of irreplaceable sites. For the widely available Oregon data set, we find a general lack of trend in the number of irreplaceable sites with the number of sites available for selection used. Moreover, we observe that irreplaceability at one level of resource may not be a predictor of irreplaceability at a higher or a lower level of resource. Finally, we investigate the economic value of irreplaceable sites by trial removals of those sites.