A column generation approach for solving a non-temporal forest harvest model with spatial structure constraints

摘要: Abstract We present an integer programming model for a non-temporal forest harvest problem with constraints on the clearcut size and total area of old growth patches minimum requirement. The has very large number variables operationally sized problems which precludes use exact solution methods. propose column generation to solve linear relaxation rounding heuristic obtain model. Column may not exactly because optimization associated pricing subproblems are NP -hard. heuristics these subproblems. Computational results test instances real life instance that corresponds Portuguese reported.