Solving the area-restricted harvest-scheduling model using the branch and bound algorithm

Author： Crowe Kevin   Nelson John   Boyland Mark  

Publisher： NRC Research Press

ISSN： 1208-6037

Source： Canadian Journal of Forest Research, Vol.33, Iss.9, 2003-09, pp. : 1804-1814

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

An evaluation of the simulated annealing algorithm for solving the area-restricted harvest-scheduling model against optimal benchmarks

By Crowe Kevin A   Nelson J D  

Canadian Journal of Forest Research, Vol. 35, Iss. 10, 2005-10 ,pp. : 2500-2509

NRC Research Press

Access to resources Recommend Favorite

Incorporating average and maximum area restrictions in harvest scheduling models

By Murray Alan T   Goycoolea Marcos   Weintraub Andrés  

Canadian Journal of Forest Research, Vol. 34, Iss. 2, 2004-02 ,pp. : 456-464

NRC Research Press

Access to resources Recommend Favorite

Scheduling forest core area production using mixed integer programming

By Wei Yu   Hoganson Howard M.  

Canadian Journal of Forest Research, Vol. 37, Iss. 10, 2007-10 ,pp. : 1924-1932

NRC Research Press

Access to resources Recommend Favorite

An optimization model for annual harvest planning

By Karlsson Jenny   Rönnqvist Mikael   Bergström Johan  

Canadian Journal of Forest Research, Vol. 34, Iss. 8, 2004-08 ,pp. : 1747-1754

NRC Research Press

Access to resources Recommend Favorite

A robust optimization approach protected harvest scheduling decisions against uncertainty

By Palma Cristian D.   Nelson John D.  

Canadian Journal of Forest Research, Vol. 39, Iss. 2, 2009-02 ,pp. : 342-355

NRC Research Press

Access to resources Recommend Favorite