Spatially constrained harvest scheduling for strip allocation under Moore and Neumann neighbourhood adjacency.

[1]  Richard L. Church,et al.  Heuristic solution approaches to operational forest planning problems , 1995 .

[2]  C. Lockwood,et al.  Harvest scheduling with spatial constraints: a simulated annealing approach , 1993 .

[3]  Atsushi Yoshimoto.  Potential use of a spatially constrained harvest scheduling model for biodiversity concerns: Exclusion periods to create heterogeneity in forest structure , 2001, Journal of Forest Research.

[4]  John Sessions,et al.  A new heuristic to solve spatially constrained long-term harvest scheduling problems , 1994 .

[5]  Mark S. Jamnick,et al.  An operational, spatially constrained harvest scheduling model , 1990 .

[6]  Charles ReVelle,et al.  The grid packing problem : selecting a harvesting pattern in an area with forbidden regions , 1996 .

[7]  Robert G. Haight,et al.  Wildlife Conservation Planning Using Stochastic Optimization and Importance Sampling , 1997 .

[8]  B. Bruce Bare,et al.  Spatially constrained timber harvest scheduling , 1989 .

[9]  C. Watkins,et al.  Close-to-nature forestry. , 2015 .

[10]  Kevin Boston,et al.  An economic and landscape evaluation of the green-up rules for California, Oregon, and Washington (USA) , 2006 .

[11]  J. D. Brodie,et al.  Comparison of a random search algorithm and mixed integer programming for solving area-based forest plans. , 1990 .

[12]  John Sessions,et al.  Integrating short-term, area-based logging plans with long-term harvest schedules , 1991 .

[13]  Atsushi Yoshimoto,et al.  Comparative analysis of algorithms to generate adjacency constraints , 1994 .

[14]  José G. Borges,et al.  Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems , 1998 .