Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method
From MaRDI portal
Publication:475253
Recommendations
- Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
- Comparing Exact and Heuristic Methods for Site Location Based on Multiple Attributes: An Afforestation Application
- A new method to solve the fully connected reserve network design problem
- Constructing And Selecting Adjacency Constraints
- Reserve assemblage of critical areas: A zero-one programming approach
Cites work
- A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs
- Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
- Comparing Exact and Heuristic Methods for Site Location Based on Multiple Attributes: An Afforestation Application
- Direct spatial optimization in natural resource management: Four linear programming examples
- Spatial optimization of resources deployment for forest-fire management
Cited in
(3)- Comparing Exact and Heuristic Methods for Site Location Based on Multiple Attributes: An Afforestation Application
- Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
- Optimal design of compact and functionally contiguous conservation management areas
This page was built for publication: Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q475253)