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

Author： Hoganson Howard M. Borges Jose G.

Publisher： Society of American Foresters

ISSN： 0015-749X

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

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

Impacts of the Time Horizon for Adjacency Constraints in Harvest Scheduling

By Hoganson M. Borges G.

Forest Science, Vol. 46, Iss. 2, 2000-05 ,pp. : 176-187

Society of American Foresters

Access to resources Recommend Favorite

Harvest Scheduling with Area-Based Adjacency Constraints

By McDill M.E. Rebain S.A. Braze J.

Forest Science, Vol. 48, Iss. 4, 2002-11 ,pp. : 631-642

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

An Indirect Search Algorithm for Harvest-Scheduling Under Adjacency Constraints

By Crowe K. Nelson J.

Forest Science, Vol. 49, Iss. 1, 2003-02 ,pp. : 1-11

Society of American Foresters

Access to resources Recommend Favorite

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

By Boston Kevin Bettinger Pete

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

Society of American Foresters

Access to resources Recommend Favorite