Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints

DOI10.1016/j.ejor.2017.07.060zbMath1374.90435OpenAlexW2744157975MaRDI QIDQ1681301

Isabel Martins, Miguel Fragoso Constantino

Publication date: 23 November 2017

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2017.07.060

zbMATH Keywords

integer programmingcutting planeforest managementOR in natural resources

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Case-oriented studies in operations research (90B90)

Related Items (6)

Optimal harvesting under marine reserves and uncertain environment ⋮ Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity ⋮ Risk management for forestry planning under uncertainty in demand and prices ⋮ Long-term plantation and harvesting planning for industrial plantation forest areas ⋮ A note on the regularity of a new metric for measuring even-flow in forest planning ⋮ On dealing with strategic and tactical decision levels in forestry planning under uncertainty

Uses Software

• ABACUS
• CPLEX
• FRAGSTATS

Cites Work

• Unnamed Item
• Unnamed Item
• A cutting plane method for solving harvest scheduling models with area restrictions
• A branch-and-price approach for harvest scheduling subject to maximum area restrictions
• Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
• Modeling forest core area with integer programming
• Reserve assemblage of critical areas: A zero-one programming approach
• Forest harvest scheduling with clearcut and core area constraints
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• Dioïds and semirings: Links to fuzzy sets and other applications
• 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
• Multiobjective grid packing model: An application in forest management
• Imposing Connectivity Constraints in Forest Planning Models
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches

This page was built for publication: Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints