Abstract
We present an integer programming model for a non-temporal forest harvest problem with constraints on the clearcut size and on the total area of old growth patches with a minimum size requirement. The model has a very large number of variables for operationally sized problems which precludes the use of exact solution methods. We propose column generation to solve the linear relaxation of the model and a linear programming rounding heuristic to obtain a solution to the model. Column generation may not solve exactly the linear relaxation because the optimization problems associated with the pricing subproblems are NP -hard. We present heuristics for these subproblems. Computational results for test instances and for a real life instance that corresponds to a large Portuguese forest are reported.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
