Forest management models and combinatorial algorithms: analysis of state of the art

Linear Programming and Mixed Integer Linear Programs have been used for forest planning since the 60's to support decision making on forest harvesting and management. In particular, during the last two decades of forest management there has been an increased interest in spatial issues. Further, new environmental concerns, such as resource sustainability and wildlife protection, impose that increased attention be paid to activities carried out on the ground. Road building needed for access also requires spatial definiton. As a result, more complex models must be used. We discuss the issues which have led to the combinatorial nature of some main forest management problems and the solution algorithms that have been proposed for these problems, including local search heuristics, random search approaches, strengthening of mixed integer model formulations and Lagrangian relaxation. In this survey, we discuss which of the proposed approaches have been used succesfully, the advantages and shortcomings of each and what are still open research problems. This revised version was published online in June 2006 with corrections to the Cover Date.