Review of combinatorial problems induced by spatial forest harvesting planning

DOI10.1016/J.DAM.2005.05.025MaRDI QIDQ2489911zbMATH OpenOpenAlexFDO

Authors Alan T. Murray, Andrés Weintraub

Publication date 28 April 2006

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2005.05.025

zbMATH Keywords

Combinatorial algorithmsEnvironmentSpatial forestry

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• Forest management models and combinatorial algorithms: Analysis of state of the art
• A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
• Forest harvest scheduling with clearcut and core area constraints
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Spatially explicit forest harvest scheduling with difference equations
• Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
• Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
• Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
• A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem
• Heuristic solution approaches to operational forest planning problems

Cites work

• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation
• A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
• Design and Implementation of an Interactive Optimization System for Telephone Network Planning
• Forest management challenges for operational researchers
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• Heuristic solution approaches to operational forest planning problems
• Support system development for forest ecosystem management

Cited in

(14)

• Forest management models and combinatorial algorithms: Analysis of state of the art
• A multiple objective methodology for sugarcane harvest management with varying maturation periods
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
• Mathematical optimization ideas for biodiversity conservation
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• Spatial environmental concerns
• Development of a threat index to manage timber production on flammable forest landscapes subject to spatial harvest constraints
• Fifty Years of OR in Forestry Preface to the Special Forestry Issue of INFOR
• Modeling harvest scheduling in multifunctional planning of forests for longterm water yield optimization
• Modeling forest core area with integer programming
• A multiobjective model for forest planning with adjacency constraints
• Spatially explicit forest harvest scheduling with difference equations
• Optimal selection of forest patches using integer and fractional programming

This page was built for publication: Review of combinatorial problems induced by spatial forest harvesting planning

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