An Analysis of Monte Carlo Integer Programming, Simulated Annealing, and Tabu Search Heuristics for Solving Spatial Harvest Scheduling Problems

Author： Boston Kevin Bettinger Pete

Publisher： Society of American Foresters

ISSN： 0015-749X

Source： Forest Science, Vol.45, Iss.2, 1999-05, pp. : 292-301

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

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

A Linear Programming, Tabu Search Method for Solving Forest-Level Bucking Optimization Problems

By Laroze Andre

Forest Science, Vol. 45, Iss. 1, 1999-02 ,pp. : 108-116

Society of American Foresters

Access to resources Recommend Favorite

Solving and Interpreting Large-Scale Harvest Scheduling Problems by Duality and Decomposition

By Berck Peter Bible Thomas

Forest Science, Vol. 30, Iss. 1, 1984-03 ,pp. : 173-182

Society of American Foresters

Access to resources Recommend Favorite

Spatial Restrictions in Harvest Scheduling

By Murray Alan T.

Forest Science, Vol. 45, Iss. 1, 1999-02 ,pp. : 45-52

Society of American Foresters

Access to resources Recommend Favorite

Using Dynamic Programming and Overlapping Subproblems to Address Adjacency in Large Harvest Scheduling Problems

By Hoganson Howard M. Borges Jose G.

Forest Science, Vol. 44, Iss. 4, 1998-11 ,pp. : 526-538

Society of American Foresters

Access to resources Recommend Favorite