摘要: Restrictions on the size and proximity of clearcuts have led to development a variety exact heuristic methods optimize net present value timber harvests, subject adjacency constraints. Most treat harvest units as pre-defined, impose constraints any two sharing common border. By using graph theory notation define sub-graph constraints, opening can be considered variable, which may more appropriate for landscape-level planning. A small example data set is used in this paper demonstrate difference between types both integer programming solution methods.
springer.com
sci-hub.se 参考文章(21)
Jose G. Borges, Howard M. Hoganson, Using dynamic programming and overlapping subproblems to address adjacency in large harvest scheduling problems Forest Science. ,vol. 44, pp. 526- 538 ,(1998)
D. K. Daust, J. D. Nelson, Spatial reduction factors for strata-based harvest schedules Forest Science. ,vol. 39, pp. 152- 165 ,(1993)
T. Nishizeki, Norishige Chiba, Planar Graphs: Theory and Algorithms ,(1988)
J. Buongiorno, J.K. Gilless, Forest management and economics MacMillan Pub. Co.,New York, NY. ,(1987)
T. M. Barrett, L. S. Davis, J. K. Gilless, Economic and fragmentation effects of clearcut restrictions Forest Science. ,vol. 44, pp. 569- 577 ,(1998) , 10.1093/FORESTSCIENCE/44.4.569
Bjarne Toft, Tommy R Jensen, Graph Coloring Problems ,(1994)
Gary Chartrand, Graphs as mathematical models ,(1977)
Abraham Kandel, Theodore P. Baker, Joe L. Mott, Discrete Mathematics for Computer Scientists and Mathematicians ,(1986)
L.G. Underhill, Optimal and suboptimal reserve selection algorithms Biological Conservation. ,vol. 70, pp. 85- 87 ,(1994) , 10.1016/0006-3207(94)90302-6
T M Barrett, Voronoi tessellation methods to delineate harvest units for spatial forest planning Canadian Journal of Forest Research. ,vol. 27, pp. 903- 910 ,(1997) , 10.1139/X96-214