Research Output

Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach

  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.

  • Type:

    Article

  • Date:

    30 September 2005

  • Publication Status:

    Published

  • Publisher

    Springer Science + Business Media

  • DOI:

    10.1007/s10666-005-9009-3

  • Cross Ref:

    9009

  • Library of Congress:

    HC Economic History and Conditions

Citation

Önal, H., & Briers, R. A. (2005). Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach. Environmental modeling & assessment, 10(3), 193-202. https://doi.org/10.1007/s10666-005-9009-3

Authors

Keywords

species representation, conservation reserve, fragmentation, graph, network tree, linear integer programming,

Monthly Views:

Available Documents