Article ID: | iaor20011862 |
Country: | Netherlands |
Volume: | 95 |
Issue: | 1 |
Start Page Number: | 159 |
End Page Number: | 175 |
Publication Date: | Jul 2000 |
Journal: | Annals of Operations Research |
Authors: | Barrett T.M., Gilless J. Keith |
Keywords: | programming: integer, graphs |
Restrictions on the size and proximity of clearcuts have led to the development of a variety of exact and heuristic methods to optimize the net present value of timber harvests, subject to adjacency constraints. Most treat harvest units as pre-defined, and impose adjacency constraints on any two units sharing a common border. By using graph theory notation to define sub-graph adjacency constraints, opening size can be considered variable, which may be more appropriate for landscape-level planning. A small example data set is used in this paper to demonstrate the difference between the two types of adjacency constraints for both integer programming and heuristic solution methods.