A note on optimal algorithms for reserve site selection

Jeffrey D. Camm; Stephen Polasky; Andrew Solow; Blair Csuti

doi:10.1016/0006-3207(95)00132-8

A note on optimal algorithms for reserve site selection

Jeffrey D. Camm, Stephen Polasky, Andrew Solow, Blair Csuti

Applied Economics

Research output: Contribution to journal › Article › peer-review

150 Scopus citations

Abstract

A recent note by Underhill (Biol. Conserv. 70, 85-7, 1994) points out the need for the use of optimization models and a closer working relationship with mathematicians for the solution of biological management problems such as the reserve site selection problem. In this note we give the mathematical formulation of what he terms 'the more realistic' version of the reserve selection problem, namely, the problem of maximizing the number of species preserved given a fixed budget for reserve sites. We also discuss some straight-forward data reduction schemes which may reduce the solution time for these problems when they are solved using general off-the-shelf optimization code as mentioned by Underhill.

Original language	English (US)
Pages (from-to)	353-355
Number of pages	3
Journal	Biological Conservation
Volume	78
Issue number	3
DOIs	https://doi.org/10.1016/0006-3207(95)00132-8
State	Published - Dec 1996

Keywords

integer programming
maximal coverage problem
reserve site selection

Access

10.1016/0006-3207(95)00132-8

OpenUrl availability

Full text

Cite this

@article{ddf7e26548b24a0fb437e8b239110736,

title = "A note on optimal algorithms for reserve site selection",

abstract = "A recent note by Underhill (Biol. Conserv. 70, 85-7, 1994) points out the need for the use of optimization models and a closer working relationship with mathematicians for the solution of biological management problems such as the reserve site selection problem. In this note we give the mathematical formulation of what he terms 'the more realistic' version of the reserve selection problem, namely, the problem of maximizing the number of species preserved given a fixed budget for reserve sites. We also discuss some straight-forward data reduction schemes which may reduce the solution time for these problems when they are solved using general off-the-shelf optimization code as mentioned by Underhill.",

keywords = "integer programming, maximal coverage problem, reserve site selection",

author = "Camm, {Jeffrey D.} and Stephen Polasky and Andrew Solow and Blair Csuti",

year = "1996",

month = dec,

doi = "10.1016/0006-3207(95)00132-8",

language = "English (US)",

volume = "78",

pages = "353--355",

journal = "Biological Conservation",

issn = "0006-3207",

publisher = "Elsevier BV",

number = "3",

}

TY - JOUR

T1 - A note on optimal algorithms for reserve site selection

AU - Camm, Jeffrey D.

AU - Polasky, Stephen

AU - Solow, Andrew

AU - Csuti, Blair

PY - 1996/12

Y1 - 1996/12

N2 - A recent note by Underhill (Biol. Conserv. 70, 85-7, 1994) points out the need for the use of optimization models and a closer working relationship with mathematicians for the solution of biological management problems such as the reserve site selection problem. In this note we give the mathematical formulation of what he terms 'the more realistic' version of the reserve selection problem, namely, the problem of maximizing the number of species preserved given a fixed budget for reserve sites. We also discuss some straight-forward data reduction schemes which may reduce the solution time for these problems when they are solved using general off-the-shelf optimization code as mentioned by Underhill.

AB - A recent note by Underhill (Biol. Conserv. 70, 85-7, 1994) points out the need for the use of optimization models and a closer working relationship with mathematicians for the solution of biological management problems such as the reserve site selection problem. In this note we give the mathematical formulation of what he terms 'the more realistic' version of the reserve selection problem, namely, the problem of maximizing the number of species preserved given a fixed budget for reserve sites. We also discuss some straight-forward data reduction schemes which may reduce the solution time for these problems when they are solved using general off-the-shelf optimization code as mentioned by Underhill.

KW - integer programming

KW - maximal coverage problem

KW - reserve site selection

UR - http://www.scopus.com/inward/record.url?scp=0030470886&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030470886&partnerID=8YFLogxK

U2 - 10.1016/0006-3207(95)00132-8

DO - 10.1016/0006-3207(95)00132-8

M3 - Article

AN - SCOPUS:0030470886

SN - 0006-3207

VL - 78

SP - 353

EP - 355

JO - Biological Conservation

JF - Biological Conservation

IS - 3

ER -

A note on optimal algorithms for reserve site selection

Abstract

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this