Pages that link to "Item:Q3392190"
From MaRDI portal
The following pages link to A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions (Q3392190):
Displaying 16 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 target volume flows in forest harvest scheduling subject to maximum area restrictions (Q458969) (← links)
- Forestry management under uncertainty (Q666469) (← links)
- Modeling forest core area with integer programming (Q666471) (← links)
- Spatially explicit forest harvest scheduling with difference equations (Q748575) (← links)
- Stochastic optimization models in forest planning: a progressive hedging solution approach (Q748577) (← links)
- Spatial uncertainty in harvest scheduling (Q748578) (← links)
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints (Q1681301) (← links)
- Forest harvest scheduling with clearcut and core area constraints (Q1686506) (← links)
- Optimal management of naturally regenerating uneven-aged forests (Q1752273) (← links)
- Long-term plantation and harvesting planning for industrial plantation forest areas (Q2033406) (← links)
- Constraint-based electoral districting using a new compactness measure: an application to Portugal (Q2676289) (← links)
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability (Q2862159) (← links)
- Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity (Q6080621) (← links)
- Stochastic forestry planning under market and growth uncertainty (Q6164380) (← links)
