Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems

DOI10.1016/j.ejor.2005.09.016zbMath1102.90028OpenAlexW2036307851MaRDI QIDQ852995

Juan Pablo Vielma, David M. Ryan, Alan T. Murray, Andrés P. Weintraub

Publication date: 15 November 2006

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

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

zbMATH Keywords

combinatorial optimizationbranch and boundelastic constraintsforest planningconstraint branching

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Related Items

Evaluation of different strategic planning approaches in a forest plantation in the North of Misiones Province, Argentina ⋮ Forest harvest scheduling with clearcut and core area constraints ⋮ Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity ⋮ 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 ⋮ Integer programming in forestry ⋮ A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability

Uses Software

• CPLEX

Cites Work

• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• Unnamed Item
• Unnamed Item