The log bucking problem: A comparison of dynamic programming versus branch and bound

DOI10.1016/0377-2217(94)90226-7zbMath0809.90127OpenAlexW2063999223MaRDI QIDQ1333552

Paul M. Bobrowski

Publication date: 15 September 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90226-7

zbMATH Keywords

forestrydynamic programmingbranch and bound

Mathematics Subject Classification ID

Case-oriented studies in operations research (90B90) Dynamic programming (90C39)

Cites Work

• Log Bucking and Lumber Manufacturing Using Dynamic Programming
• Selection and Design of Heuristic Procedures for Solving Roll Trim Problems

This page was built for publication: The log bucking problem: A comparison of dynamic programming versus branch and bound