Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach
- First Online:
- Cite this article as:
- Önal, H. & Briers, R.A. Environ Model Assess (2005) 10: 193. doi:10.1007/s10666-005-9009-3
- 208 Downloads
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.