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...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
PeerJ Inc.
2020-05-01
|
| Series: | PeerJ |
| Subjects: | |
| Online Access: | https://peerj.com/articles/9258.pdf |