Combining a Decomposition Strategy with Dynamic Programming to Solve Spatially Constrained Forest Management Scheduling Problems

Author： Borges José G. Hoganson Howard M. Rose Dietmar W.

Publisher： Society of American Foresters

ISSN： 0015-749X

Source： Forest Science, Vol.45, Iss.2, 1999-05, pp. : 201-212

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A New Heuristic To Solve Spatially Constrained Long-Term Harvest Scheduling Problems

By Yoshimoto Atsushi Brodie J. Douglas Sessions John

Forest Science, Vol. 40, Iss. 3, 1994-08 ,pp. : 365-396

Society of American Foresters

Access to resources Recommend Favorite

Combining Random and Systematic Search Heuristic Procedures for Solving Spatially Constrained Forest Management Scheduling Models

By Falcão A.O. Borges J.

Forest Science, Vol. 48, Iss. 3, 2002-08 ,pp. : 608-621

Society of American Foresters

Access to resources Recommend Favorite

Solution of a Large-Scale Forest Scheduling Problem by Linear Programming Decomposition

By Liittschwager J. M. Tcheng T. H.

Journal of Forestry, Vol. 65, Iss. 9, 1967-09 ,pp. : 644-646

Society of American Foresters

Access to resources Recommend Favorite

Combining Tabu Search and Genetic Algorithm Heuristic Techniques to Solve Spatial Harvest Scheduling Problems

By Boston K. Bettinger P.

Forest Science, Vol. 48, Iss. 1, 2002-02 ,pp. : 35-46

Society of American Foresters

Access to resources Recommend Favorite

Notes: A Comparison of Dynamic Programming and A* in Optimal Forest Stand Management

By Arthaud Greg J. Pelkki Matthew H.

Forest Science, Vol. 42, Iss. 4, 1996-11 ,pp. : 498-503

Society of American Foresters

Access to resources Recommend Favorite