Forest harvest scheduling with clearcut and core area constraints
DOI10.1007/s10479-016-2313-2zbMath1381.90039OpenAlexW2515953796MaRDI QIDQ1686506
Teresa Neto, Isabel Martins, João Pedro Pedroso, Miguel Fragoso Constantino
Publication date: 15 December 2017
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-016-2313-2
Integer programming (90C10) Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (4)
Uses Software
Cites Work
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions
- Modeling forest core area with integer programming
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
- Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions?
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- Understanding Shape: Angles and Sides
- Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
This page was built for publication: Forest harvest scheduling with clearcut and core area constraints