Application of optimization for solving a sawing stock problem with a cant sawing pattern

DOI10.1007/s11590-017-1178-xzbMath1420.90039OpenAlexW2742482924MaRDI QIDQ1634783

Denis Borenstein, Everton da Silveira Farias, Juan Leandro Andres Parra Galvez

Publication date: 18 December 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1178-x

zbMATH Keywords

optimizationcutting stocksawmillcant sawing

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11)

Cites Work

• Lumber production optimization
• Optimal solutions for the cutting stock problem
• An application of deterministic and robust optimization in the wood cutting industry
• An improved typology of cutting and packing problems
• A Linear Programming Approach to the Cutting-Stock Problem
• Log Bucking and Lumber Manufacturing Using Dynamic Programming
• A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production
• Selected Topics in Column Generation

This page was built for publication: Application of optimization for solving a sawing stock problem with a cant sawing pattern