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

DOI10.1016/0377-2217(94)90226-7MaRDI QIDQ1333552zbMATH OpenOpenAlexFDO

Authors 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

dynamic programmingforestrybranch and bound

Mathematics Subject Classification ID

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

Recommendations

• The Effects of Modelling on Log Bucking Solution Techniques
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• Exact solution of two location problems via branch-and-bound
• General branch and bound, and its relation to A^* and AO^*
• A common schema for dynamic programming and branch and bound algorithms

Cites work

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

Cited in

(2)

• Secondary log breakdown optimization with dynamic programming
• The Effects of Modelling on Log Bucking Solution Techniques

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333552)