![]() |
CiteULike | ![]() |
rocarvaj's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
A column generation approach for solving a non-temporal forest harvest model with spatial structure constraintsEuropean Journal of Operational Research In Financial Modelling, Vol. 161, No. 2. (1 March 2005), pp. 478-498.
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractWe 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 -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.
BibTeX record
RIS record