Glossary · approach
Cutting Stock Problem
The problem of extracting required pieces from standard rolls or sheets with the least waste.
CSPNestingTrim-Loss Problem
The Cutting Stock Problem (CSP) is the problem of meeting an order for differently sized pieces by cutting them out of standard-sized stock (fabric rolls, steel sheets, MDF panels, paper rolls) with the least trim loss. Solved by Gilmore and Gomory in 1961 via column generation, it is one of the classic problems of combinatorial optimization. One-dimensional (1D — rolls, bars), two-dimensional (2D — sheets), and irregular-shape (irregular nesting, e.g. leather) variants all exist. It's the core lever for 5–12% material-cost reductions in textile, sheet metal, furniture, paper-and-board, glass, and aerospace supply.
Örnek
From a 100-meter fabric roll, how do you cut 30 different pieces (each 1.5–4 meters) with the least waste? That's the classic 1D cutting stock problem.