An algorithm for a cutting stock problem on a strip
From MaRDI portal
Recommendations
Cited in
(16)- An effective solution for a real cutting stock problem in manufacturing plastic rolls
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
- On the effectivity of gradient methods for cutting stock problems
- Approximation solutions for the cutting stock `portfolio' problem
- Pattern minimisation in cutting stock problems
- An application of deterministic and robust optimization in the wood cutting industry
- An improved typology of cutting and packing problems
- Roll cutting in the curtain industry, or: a well-solvable allocation problem
- A matching approach for replenishing rectangular stock sizes
- Fast pattern-based algorithms for cutting stock
- An algorithm for the two-dimensional cutting-stock problem based on a pattern generation procedure
- A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem
- scientific article; zbMATH DE number 1179834 (Why is no real title available?)
- Recursive algorithm for the two‐dimensional cutting problem of punched strips
- A new heuristic for rectangular stock-cutting problem
- Heuristic algorithm for a cutting stock problem in the steel bridge construction
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)
