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

DOI10.1016/J.EJOR.2005.09.016MaRDI QIDQ852995zbMATHOpenAlexFDO

Authors J. P. Vielma, Alan T. Murray, David M. Ryan, Andrés 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)

Recommendations

• Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• 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
• A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions

Cites work

• scientific article; zbMATH DE number 3470175 (Why is no real title available?)
• scientific article; zbMATH DE number 2159088 (Why is no real title available?)
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms

Cited in

(13)

• Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
• A branch-and-price approach for harvest scheduling subject to maximum area restrictions
• A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability
• Solving allocation and scheduling problems inherent in forest resource management using mixed-integer programming
• Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
• A multi-objective Monte Carlo tree search for forest harvest scheduling
• Forest harvest scheduling with clearcut and core area constraints
• Review of combinatorial problems induced by spatial forest harvesting planning
• Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity
• Evaluation of different strategic planning approaches in a forest plantation in the North of Misiones Province, Argentina
• Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
• Integer programming in forestry
• Can mature patch constraints mitigate the fragmenting effects of harvest opening size restrictions?

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q852995)