A 2-Opt Tabu Search Procedure for the Multiperiod Forest Harvesting Problem with Adjacency, Greenup, Old Growth, and Even Flow Constraints

Author： Caro F. Constantino M. Martins I. Weintraub A.

Publisher： Society of American Foresters

ISSN： 0015-749X

Source： Forest Science, Vol.49, Iss.5, 2003-10, pp. : 738-751

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

Multiple-Pass Harvesting and Spatial Constraints: An Old Technique Applied to a New Problem

By Nelson J. D. Errico D.

Forest Science, Vol. 39, Iss. 1, 1993-02 ,pp. : 137-151

Society of American Foresters

Access to resources Recommend Favorite

Adjacency Branches Used To Optimize Forest Harvesting Subject to Area Restrictions on Clearfell

By McNaughton Alastair J. Ryan David

Forest Science, Vol. 54, Iss. 4, 2008-08 ,pp. : 442-454

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

Using the Branch and Bound Algorithm to Solve Forest Planning Problems with Adjacency Constraints

By McDill M.E. Braze J.

Forest Science, Vol. 47, Iss. 3, 2001-08 ,pp. : 403-418

Society of American Foresters

Access to resources Recommend Favorite

A Column Generation Algorithm for Solving General Forest Planning Problems with Adjacency Constraints

By Weintraub Andrés Barahona Francisco Epstein Rafael

Forest Science, Vol. 40, Iss. 1, 1994-02 ,pp. : 142-161

Society of American Foresters

Access to resources Recommend Favorite