Pages that link to "Item:Q1681301"
From MaRDI portal
The following pages link to Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301):
Displaying 18 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)
- Optimal selection of forest patches using integer and fractional programming (Q968037) (← links)
- A new harvest operation cost model to evaluate forest harvest layout alternatives (Q1593491) (← links)
- Forest harvest scheduling with clearcut and core area constraints (Q1686506) (← links)
- Risk management for forestry planning under uncertainty in demand and prices (Q1754283) (← links)
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939) (← links)
- Long-term plantation and harvesting planning for industrial plantation forest areas (Q2033406) (← links)
- Optimal harvesting under marine reserves and uncertain environment (Q2140306) (← links)
- A note on the regularity of a new metric for measuring even-flow in forest planning (Q2286902) (← links)
- A multi-objective Monte Carlo tree search for forest harvest scheduling (Q2286904) (← links)
- On dealing with strategic and tactical decision levels in forestry planning under uncertainty (Q2289912) (← links)
- Review of combinatorial problems induced by spatial forest harvesting planning (Q2489911) (← links)
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability (Q2862159) (← links)
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions (Q3392190) (← links)
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)
- Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity (Q6080621) (← links)
