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...

ver descrição completa

Na minha lista:
Detalhes bibliográficos
Main Authors: Richard Schuster, Jeffrey O. Hanson, Matthew Strimas-Mackey, Joseph R. Bennett
Formato: Artigo
Idioma:Inglês
Publicado em: PeerJ Inc. 2020-05-01
Colecção:PeerJ
Assuntos:
Conservation planning
Optimization
Prioritization
Integer linear programming
Prioritizr
Marxan
Acesso em linha:https://peerj.com/articles/9258.pdf
Tags: Adicionar Tag
Sem tags, seja o primeiro a adicionar uma tag!

Registos relacionados