Journal
ENVIRONMENTAL MODELING & ASSESSMENT
Volume 10, Issue 4, Pages 341-348Publisher
SPRINGER
DOI: 10.1007/s10666-005-9015-5
Keywords
reserve selection; integer programming; species preservation; coverage models
Categories
Ask authors/readers for more resources
Models for designing habitat reserve networks have focused on minimizing the number of sites necessary to cover each species one or more times. A solution to this problem is usually one from among a large number of alternative optimal configurations of sites. This paper develops an iterative method for building reserve networks that produces an optimal solution to the species set covering problem (SSCP) and also maximizes the number of species covered two or more times, three or more times, and so on, conditional on the solution to the previous iteration. We refer to this as representational success. Thus, a pareto optimal species set covering is achieved that is preferable to an arbitrary optimal solution to the SSCP.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available