An algorithm for a cutting stock problem on a strip
From MaRDI portal
Publication:4367016
DOI10.1057/PALGRAVE.JORS.2600351zbMATH Open0890.90154OpenAlexW2047800743MaRDI QIDQ4367016FDOQ4367016
Authors: Stefano Benati 
Publication date: 25 November 1997
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600351
Recommendations
Cited In (15)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- Roll cutting in the curtain industry, or: a well-solvable allocation problem
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- An effective solution for a real cutting stock problem in manufacturing plastic rolls
- An improved typology of cutting and packing problems
- Fast pattern-based algorithms for cutting stock
- An application of deterministic and robust optimization in the wood cutting industry
- A matching approach for replenishing rectangular stock sizes
- Pattern minimisation in cutting stock problems
- On the effectivity of gradient methods for cutting stock problems
- A new heuristic for rectangular stock-cutting problem
- A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem
- Approximation solutions for the cutting stock `portfolio' problem
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
This page was built for publication: An algorithm for a cutting stock problem on a strip
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4367016)
