Pages that link to "Item:Q6080621"
From MaRDI portal
The following pages link to Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity (Q6080621):
Displaying 6 items.
- A hybrid constraint programming approach to a wood procurement problem with bucking decisions (Q272019) (← links)
- Concurrent optimization of harvesting and road network layouts under steep terrain (Q748552) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- A multi-objective Monte Carlo tree search for forest harvest scheduling (Q2286904) (← links)
- Review of combinatorial problems induced by spatial forest harvesting planning (Q2489911) (← links)
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)
