An algorithm for a cutting stock problem on a strip
From MaRDI portal
Publication:4367016
DOI10.1057/palgrave.jors.2600351zbMath0890.90154OpenAlexW2047800743MaRDI QIDQ4367016
Publication date: 25 November 1997
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600351
Related Items (3)
An improved typology of cutting and packing problems ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ An application of deterministic and robust optimization in the wood cutting industry
This page was built for publication: An algorithm for a cutting stock problem on a strip
