Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach |
| |
Authors: | Hayri??nal Email author" target="_blank">Robert?A?BriersEmail author |
| |
Institution: | (1) Department of Agricultural and Consumer Economics, University of Illinois at Urbana–Champaign, Urbana, Illinois 61801, USA;(2) School of Life Sciences, Napier University, 10 Colinton Road, Edinburgh, EH10 5DT, UK |
| |
Abstract: | In the biological conservation literature, the optimum reserve site selection problem has often been addressed by using the
prototype set covering and maximal covering formulations, assuming that representation of species is the only criterion in
site selection. This approach usually results in a small but highly fragmented reserve, which is not useful for practical
conservation planning. To improve the chances of species' persistence, it may be desirable to reduce habitat fragmentation.
This paper presents a linear integer programming formulation to minimize spatial gaps between selected sites in a reserve
network, which is applied to a data set on breeding birds.
The authors express their willingness to share the database used in this study. Those readers who wish to have access to the
data may contact Robert A. Briers at r.briers@napier.ac.uk. |
| |
Keywords: | species representation conservation reserve fragmentation graph network tree linear integer programming |
本文献已被 SpringerLink 等数据库收录! |
|