Modeling forest core area with integer programming
From MaRDI portal
Publication:666471
DOI10.1007/s10479-009-0517-4zbMath1233.90222OpenAlexW2056085694WikidataQ57711526 ScholiaQ57711526MaRDI QIDQ666471
André Falcão, Huizhen Zhang, Miguel Fragoso Constantino
Publication date: 8 March 2012
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-009-0517-4
Related Items (3)
Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints ⋮ Forest harvest scheduling with clearcut and core area constraints ⋮ A multi-objective Monte Carlo tree search for forest harvest scheduling
Cites Work
- Unnamed Item
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- Review of combinatorial problems induced by spatial forest harvesting planning
- 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
This page was built for publication: Modeling forest core area with integer programming