A cutting stock problem and its solution in the manufacturing industry of large electric generators
From MaRDI portal
Publication:1777147
DOI10.1016/j.cor.2003.11.022zbMath1075.90024OpenAlexW2048911564MaRDI QIDQ1777147
Publication date: 12 May 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.022
Related Items (3)
Renovation of the cutting stock process ⋮ Dynamic programming algorithms for generating optimal strip layouts ⋮ Modified greedy heuristic for the one-dimensional cutting stock problem
Uses Software
Cites Work
- Unnamed Item
- A generic approach for nesting of 2-D parts in 2-D sheets using genetic and heuristic algorithms
- Unbounded knapsack problem: Dynamic programming revisited
- A 2-exchange heuristic for nesting problems
- LP models for bin packing and cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
This page was built for publication: A cutting stock problem and its solution in the manufacturing industry of large electric generators