Reserve assemblage of critical areas: A zero-one programming approach
From MaRDI portal
Recommendations
Cited in
(17)- Reserve design for species preservation
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- Spatial optimization of multiple area land acquisition
- Designing compact, connected and gap-free reserves with systematic reserve site selection models
- A genetic algorithm approach to multiobjective land use planning
- The generalized reserve set covering problem with connectivity and buffer requirements
- scientific article; zbMATH DE number 1803763 (Why is no real title available?)
- Optimal design of compact and functionally contiguous conservation management areas
- Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method
- Multiobjective programming methods in the reserve selection problem.
- Reconsidering compact measures: a multiobjective framework for ecological reserve design
- Direct spatial optimization in natural resource management: Four linear programming examples
- Selection of priority areas for nature conservation in former lignite mining areas using the Hasse diagram technique and iterative selection algorithms
- Mathematical optimization ideas for biodiversity conservation
- 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
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)