Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity

DOI10.1111/itor.13183MaRDI QIDQ6080621

Jan Kašpar, Filipe Alvelos, Isabel Martins, Unnamed Author, Adelaide Cerveira

Publication date: 4 October 2023

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

zbMATH Keywords

integer programmingDantzig-Wolfe decompositionconnectivitybranch-and-pricebucket formulation

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• A branch-and-price approach for harvest scheduling subject to maximum area restrictions
• Spatially explicit forest harvest scheduling with difference equations
• Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
• A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches

This page was built for publication: Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity