Solving the area-restricted harvest-scheduling model using the branch and bound algorithm

@inproceedings{Crowe2003SolvingTA,
  title={Solving the area-restricted harvest-scheduling model using the branch and bound algorithm},
  author={Kevin A. Crowe and John Nelson and Mark Boyland},
  year={2003}
}
There are two broad approaches to the discrete optimization problem of harvest scheduling with adjacency constraints: the unit-restricted model and the area-restricted model. In this paper two formulations of the area-restricted model are solved using the branch and bound algorithm. These formulations are tested on a set of approximately 30 tactical planning problems that range in size from 346 to 6093 polygons scheduled over three time periods. Our results show that these formulations can be… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 32 CITATIONS

Spatial considerations of an area restriction model for identifying harvest blocks at commercial forest plantations

Jan Kaspar, Gerardo F. E. Perez, Adelaide Cerveira, Róbert Marušák
  • 2016
VIEW 3 EXCERPTS
CITES BACKGROUND & RESULTS
HIGHLY INFLUENCED