English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

The design of nature reserves is becoming, more and more, a crucial task forensuring the conservation of endangered wildlife. In order to guarantee thepreservation of species and a general ecological functioning, the designedreserves must typically verify a series of spatial requirements. Among therequired characteristics, practitioners and researchers have pointed out twocrucial aspects: (i) connectivity, so as to avoid spatial fragmentation, and(ii) the design of buffer zones surrounding (or protecting) so-called coreareas. In this paper, we introduce the Generalized Reserve Set Covering Problemwith Connectivity and Buffer Requirements. This problem extends the classicalReserve Set Covering Problem and allows to address these two requirementssimultaneously. A solution framework based on Integer Linear Programming andbranch-and-cut is developed. The framework is enhanced by valid inequalities, aconstruction and a primal heuristic and local branching. An extensivecomputational study on grid-graph instances and real-life instances based ondata from three states of the U.S. and one region of Australia is carried outto assess the suitability of the proposed model to deal with the challengesfaced by decision-makers in natural reserve design. The results show, on theone hand, the flexibility of the proposed models to provide solutions accordingto the decision-makers' requirements, and on the other hand, the effectivenessof the devised algorithm for providing' good solutions in reasonable computingtimes.

The Generalized Reserve Set Covering Problem with Connectivity and Buffer Requirements