Forest harvesting and minimum cuts: A new approach to handling spatial constraints

Forest Science

Volumn 43, Issue 4, 1997, Pages 544-554

  Hochbaum, Dorit S ^a   Pathria, Anu ^b  

^a DEPARTMENT OF INDUSTRIAL ENGINEERING AND OPERATIONS RESEARCH   (United States)

^b HNC Software Inc   (United States)

Author keywords

Forest harvesting; Independent set; Minimum cut; Spatial allocation

Indexed keywords

EID: 0030705163     PISSN: 0015749X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. AHUJA R.K., T.L. MAGNANTI, AND J.B. ORLIN. 1993. Network flows: Theory, algorithms, and applications. Prentice-Hall, Englewood Cliffs, NJ.
2. BAASE S. 1988. Computer algorithms: Introduction to design and analysis. Addison Wesley, Reading, MA.
3. BAKER, B.S. 1994. Approximation algorithms for NP-Complete problems on planar graphs. J. Assoc. Comput. Mach. 41(1):153-180.
4. BARAHONA F., A. WEINTRAUB, AND R. EPSTEIN. 1992. Habitat dispersion in forest planning and the stable set problem. Op. Res., 40:14-21.
5. GAREY, M.R., AND D.S. JOHNSON. 1979. Computers and intractability: A guide to the theory of NP-completeness. Freeman, San Francisco.
6. GAREY M.R., D.S. JOHNSON, AND L. STOCKMEYER. 1976. Some simplified NP-complete graph problems. Theor. Comput. Sci., 1:237-267.
7. GOEMANS, M.X., AND D.P. WILLIAMSON. 1995. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6):1115-1145.
8. GOLDBERG, A.V., AND R.E. TARJAN. 1988. A new approach to the maximum-flow problem. J. Assoc. Comput. Mach. 35(4):921-940.
9. HADLOCK, F.O. 1975. Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4:221-225.
10. HARARY, F. 1969. Graph theory. Addison-Wesley, Reading, MA.
11. HOCHBAUM, D.S., AND A. PATHRIA. 1995. Approximating a generalization of MAX-2SAT and MIN-2SAT. Unpublished manuscript. 13 p.
12. HOF, J.G., AND L.A. JOYCE. 1992. Spatial optimization for wildlife and timber in managed forest ecosystems. For. Sci. 38(3):489-508.
13. HOF, J.G., AND L.A. JOYCE. 1993. A mixed linear integer programming approach for spatially optimizing wildlife and timber in managed forest ecosystems. For. Sci. 39(4):816-834.
14. LIPTON, R.J., AND R.E. TARJAN. 1980. Applications of a planar separator theorem. SIAM J. Comput. 9(3):615-627.
15. LOCKWOOD, C., AND T. MOORE. 1993. Harvest scheduling with spatial constraints: A simulated annealing approach. Can. J. For. Res. 23:468-478.
16. PAPADIMITRIOU, C.H., AND K. STEIGLITZ. 1982. Combinatorial optimization: Algorithms and complexity. Prentice-Hall, Englewood Cliffs, NJ.