Skip to main content

Dynamic minimum set problem for reserve design: Heuristic solutions for large problems

Dates

Publication Date

Citation

Bonneau, M., Sabbadin, R., Johnson, F.A., and Stith, B., 2018, Dynamic minimum set problem for reserve design: Heuristic solutions for large problems: PLoS ONE, v. 13, no. 3, art. e0193093, https://doi.org/10.1371/journal.pone.0193093.

Summary

Conversion of wild habitats to human dominated landscape is a major cause of biodiversity loss. An approach to mitigate the impact of habitat loss consists of designating reserves where habitat is preserved and managed. Determining the most valuable areas to preserve in a landscape is called the reserve design problem. There exists several possible formulations of the reserve design problem, depending on the objectives and the constraints. In this article, we considered the dynamic problem of designing a reserve that contains a desired area of several key habitats. The dynamic case implies that the reserve cannot be designed in one time step, due to budget constraints, and that habitats can be lost before they are reserved, due for [...]

Contacts

Attached Files

Thumbnail
Thumbnail

Tags

Categories
Publication
Types

Additional Information

Identifiers

Type Scheme Key
local-index unknown 70198102
local-pk unknown 70198102
doi http://www.loc.gov/standards/mods/mods-outline-3-5.html#identifier doi:10.1371/journal.pone.0193093
series unknown PLoS ONE

Citation Extension

citationTypeArticle
journalPLoS ONE
languageEnglish
parts
typevolume
value13
typeissue
value3

Item Actions

View Item as ...

Save Item as ...

View Item...