Pages that link to "Item:Q1887939"
From MaRDI portal
The following pages link to A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939):
Displaying 15 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)
- Management of the risk of wind damage in forestry: a graph-based Markov decision process approach (Q666475) (← 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)
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints (Q1887939) (← 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)
- Stronger column generation bounds for the minimum cost hop-and-root constrained forest problem (Q2840729) (← links)
- A branch-and-bound procedure for forest harvest scheduling problems addressing aspects of habitat availability (Q2862159) (← links)
- A Problem of Forest Harvesting and Road Building Solved Through Model Strengthening and Lagrangean Relaxation (Q3637375) (← links)
- Technical Note—Forest Outturn Optimization by Dantzig-Wolfe Decomposition and Dynamic Programming Column Generation (Q3677489) (← links)
- Design and Implementation of an Interactive Optimization System for Telephone Network Planning (Q3990558) (← links)
- Solving a harvest scheduling optimization problem with constraints on clearcut area and clearcut proximity (Q6080621) (← links)
