Compactness and flow minimization requirements in reforestation initiatives: a heuristic solution method

DOI10.1007/s10479-011-0874-7zbMath1303.90061OpenAlexW2002064546MaRDI QIDQ475253

Pablo Vanegas, Jos Van Orshoven, Anja Wijffels, Dirk G. Cattrysse

Publication date: 26 November 2014

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: http://dspace.ucuenca.edu.ec/handle/123456789/22027

zbMATH Keywords

integer programmingheuristicflow minimizationsite allocationsite location

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)

Uses Software

• icity

Cites Work

• Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
• Direct spatial optimization in natural resource management: Four linear programming examples
• Spatial Optimization of Resources Deployment for Forest-Fire Management
• A linear-size zero?one programming model for the minimum spanning tree problem in planar graphs
• Comparing Exact and Heuristic Methods for Site Location Based on Multiple Attributes: An Afforestation Application