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

Author： Weintraub Andrés Barahona Francisco Epstein Rafael

Publisher： Society of American Foresters

ISSN： 0015-749X

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

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

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

Comparing Adjacency Constraint Formulations for Randomly Generated Forest Planning Problems with Four Age-Class Distributions

By McDill M.E. Braze J.

Forest Science, Vol. 46, Iss. 3, 2000-08 ,pp. : 423-436

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

Formulating Adjacency Constraints in Linear Optimization Models for Scheduling Projects in Tactical Planning

By Jones J. Greg Meneghin Bruce J. Kirby Malcolm W.

Forest Science, Vol. 37, Iss. 5, 1991-11 ,pp. : 1283-1297

Society of American Foresters

Access to resources Recommend Favorite

3-level MCGP: an efficient algorithm for MCGP in solving multi-forest management problems

By Chen Ying-Ta Zheng Chinlong Chang Ching-Ter

Scandinavian Journal of Forest Research, Vol. 26, Iss. 5, 2011-10 ,pp. : 457-465

Taylor & Francis Ltd

Access to resources Recommend Favorite