Pages that link to "Item:Q1686506"
From MaRDI portal
The following pages link to Forest harvest scheduling with clearcut and core area constraints (Q1686506):
Displaying 11 items.
- A cutting plane method for solving harvest scheduling models with area restrictions (Q257266) (← links)
- A branch-and-price approach for harvest scheduling subject to maximum area restrictions (Q434163) (← links)
- Modeling forest core area with integer programming (Q666471) (← links)
- A new harvest operation cost model to evaluate forest harvest layout alternatives (Q1593491) (← links)
- Timber harvest scheduling with price uncertainty using Markowitz portfolio optimization (Q1593504) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- Long-term plantation and harvesting planning for industrial plantation forest areas (Q2033406) (← 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)
- Evolutionary neighborhood discovery algorithm for agricultural routing planning in multiple fields (Q2675707) (← links)
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability (Q2862159) (← links)