Reserve assemblage of critical areas: A zero-one programming approach

DOI10.1016/S0377-2217(97)00017-9MaRDI QIDQ1291679zbMATH OpenOpenAlexFDO

Authors Justin C. Williams, C. S. Revelle

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

zbMATH Keywords

integer programmingprotected area designreserve selection

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Recommendations

• Reserve design for species preservation
• Optimal Selection of a Connected Reserve Network
• Optimal reserve site selection with distance requirements
• scientific article; zbMATH DE number 1803763
• A mathematical model for zoning of protected natural areas

Cited in

(15)

• Spatial optimization of multiple area land acquisition
• Direct spatial optimization in natural resource management: Four linear programming examples
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Mathematical optimization ideas for biodiversity conservation
• scientific article; zbMATH DE number 1803763 (Why is no real title available?)
• A genetic algorithm approach to multiobjective land use planning
• Optimal reserve site selection with distance requirements
• A multi-objective model for environmental investment decision making
• Selecting compact habitat reserves for species with differential habitat size needs
• The generalized reserve set covering problem with connectivity and buffer requirements
• Reserve design for species preservation
• Multiobjective programming methods in the reserve selection problem.
• Optimal design of compact and functionally contiguous conservation management areas
• Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method
• Selection of priority areas for nature conservation in former lignite mining areas using the Hasse diagram technique and iterative selection algorithms

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Reserve assemblage of critical areas: A zero-one programming approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291679)