Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
From MaRDI portal
(Redirected from Publication:458969)
Recommendations
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems
- Spatially explicit forest harvest scheduling with difference equations
- A cutting plane method for solving harvest scheduling models with area restrictions
Cites work
- scientific article; zbMATH DE number 51430 (Why is no real title available?)
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
- A multicriteria approach to the location of public facilities
- A multiobjective model for forest planning with adjacency constraints
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- An algorithm for the bi-criterion integer programming problem
- Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- Introduction to applied optimization
- Multiobjective programming and planning
- Proper efficiency and the theory of vector maximization
Cited in
(13)- Allocating reforestation areas for sediment flow minimization: an integer programming formulation and~a~heuristic solution method
- Long-term plantation and harvesting planning for industrial plantation forest areas
- Spatially explicit forest harvest scheduling with difference equations
- A multiple objective methodology for sugarcane harvest management with varying maturation periods
- Primal-dual methods for sustainable harvest scheduling problems
- Branch-and-cut for the forest harvest scheduling subject to clearcut and core area constraints
- A Primal-dual Steepest-edge Method for Even-flow Harvest Scheduling Problems
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- A theoretical minimal solution for heuristics: the case of the spatial harvest timber problem
- A note on the regularity of a new metric for measuring even-flow in forest planning
- SCHEDULING THE HARVESTING OPERATIONS OF A FOREST BLOCK: A CASE STUDY
- A multi-objective Monte Carlo tree search for forest harvest scheduling
- Modeling harvest scheduling in multifunctional planning of forests for longterm water yield optimization
This page was built for publication: Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q458969)