Exact integer linear programming solvers outperform simulated annealing for solving conservation planning problems

The resources available for conserving biodiversity are limited, and so protected areas need to be established in places that will achieve objectives for minimal cost. Two of the main algorithms for solving systematic conservation planning problems are Simulated Annealing (SA) and exact integer line...

Descripción completa

Detalles Bibliográficos
Autores principales: Schuster, Richard, Hanson, Jeffrey O., Strimas-Mackey, Matthew, Bennett, Joseph R.
Formato: Online Artículo Texto
Lenguaje:English
Publicado: PeerJ Inc. 2020
Materias:
Biodiversity
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7261139/
https://www.ncbi.nlm.nih.gov/pubmed/32518737
http://dx.doi.org/10.7717/peerj.9258

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7261139/
https://www.ncbi.nlm.nih.gov/pubmed/32518737
http://dx.doi.org/10.7717/peerj.9258

Ejemplares similares