Reserve assemblage of critical areas: A zero-one programming approach
From MaRDI portal
Publication:1291679
DOI10.1016/S0377-2217(97)00017-9zbMath0955.90091OpenAlexW2032147830MaRDI QIDQ1291679
Charles S. Re Velle, Justin C. Williams
Publication date: 22 February 2001
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(97)00017-9
Related Items (9)
A genetic algorithm approach to multiobjective land use planning ⋮ Optimal design of compact and functionally contiguous conservation management areas ⋮ A multi-objective model for environmental investment decision making ⋮ Selecting compact habitat reserves for species with differential habitat size needs ⋮ Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints ⋮ Multiobjective programming methods in the reserve selection problem. ⋮ The generalized reserve set covering problem with connectivity and buffer requirements ⋮ Reserve design for species preservation ⋮ Mathematical optimization ideas for biodiversity conservation
Uses Software
Cites Work
This page was built for publication: Reserve assemblage of critical areas: A zero-one programming approach
