A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability

DOI10.1111/itor.12003zbMath1276.90026MaRDI QIDQ2862159

Isabel Martins, Teresa Neto, João Pedro Pedroso, Miguel Fragoso Constantino

Publication date: 14 November 2013

Published in: International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/itor.12003

zbMATH Keywords

forestry; integer programming; scheduling; branch and bound; tree algorithms

Mathematics Subject Classification ID

90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut

90B35: Deterministic scheduling theory in operations research

Related Items

Exact mathematical formulations and metaheuristic algorithms for production cost minimization: a case study of the cable industry, Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints, Forest harvest scheduling with clearcut and core area constraints, Long-term plantation and harvesting planning for industrial plantation forest areas, A multi-objective Monte Carlo tree search for forest harvest scheduling

Cites Work

• A branch-and-price approach for harvest scheduling subject to maximum area restrictions
• Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
• Solving an integrated employee timetabling and job-shop scheduling problem via hybrid branch-and-bound
• Heuristics and exact methods for number partitioning
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• 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
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches