Evaluating approaches for solving the area restriction model in harvest scheduling

  • Goycoolea M
  • Murray A
  • Vielma J
 et al. 
  • 31

    Readers

    Mendeley users who have this article in their library.
  • 30

    Citations

    Citations of this article.

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.

Author-supplied keywords

  • Adjacency
  • Area restriction model
  • Green-up
  • Integer programming
  • Optimization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • SCOPUS: 2-s2.0-64549132127
  • ISSN: 0015749X
  • SGR: 64549132127
  • PUI: 354460354

Authors

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free