Abstract

We survey three integer-programming approaches for solving the area restriction model for harvest scheduling. We describe and analyze each of these approaches in detail, comparing them both from a modeling and computational point of view. In our analysis of these formulations as modeling tools, we show how each can be extended to incorporate additional harvest scheduling concerns. In our computational analysis we illustrate the strengths and weaknesses of each formulation as a practical optimization tool by studying harvest scheduling in four North American forests. For. Sci. 55(2):149-165. Copyright © 2009 by the Society of American Foresters.