Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions
DOI10.1007/s11750-012-0260-xzbMath1298.90049OpenAlexW2040106746MaRDI QIDQ458969
Jorge Cadima, Mujing Ye, Maria da Conceição Fonseca, Isabel Martins, Miguel Fragoso Constantino
Publication date: 8 October 2014
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-012-0260-x
integer programmingmulti-objective programmingvolume constraintarea restriction modelforest harvest scheduling
Integer programming (90C10) Management decision making, including multiple objectives (90B50) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- A multiobjective model for forest planning with adjacency constraints
- Improving computational capabilities for addressing volume constraints in forest harvest scheduling problems
- An algorithm for the bi-criterion integer programming problem
- A multicriteria approach to the location of public facilities
- Multiobjective programming and planning
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints
- A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints
- Proper efficiency and the theory of vector maximization
- A New Mixed-Integer Programming Model for Harvest Scheduling Subject to Maximum Area Restrictions
- Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches
- Introduction to applied optimization
This page was built for publication: Modeling target volume flows in forest harvest scheduling subject to maximum area restrictions