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

Hayri Önal, Robert A. Briers

Research output: Contribution to journalArticle

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.

Original languageEnglish (US)
Pages (from-to)193-202
Number of pages10
JournalEnvironmental Modeling and Assessment
Volume10
Issue number3
DOIs
StatePublished - Sep 1 2005

Keywords

  • Conservation reserve
  • Fragmentation
  • Graph
  • Linear integer programming
  • Network tree
  • Species representation

ASJC Scopus subject areas

  • Environmental Science(all)

Fingerprint Dive into the research topics of 'Designing a conservation reserve network with minimal fragmentation: A linear integer programming approach'. Together they form a unique fingerprint.

  • Cite this