The two-dimensional cutting stock problem revisited (Q1774168)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The two-dimensional cutting stock problem revisited |
scientific article; zbMATH DE number 2162526
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The two-dimensional cutting stock problem revisited |
scientific article; zbMATH DE number 2162526 |
Statements
The two-dimensional cutting stock problem revisited (English)
0 references
29 April 2005
0 references
A given set of oriented rectangles has to be packed without rotations into a rectangular strip of fixed width so as to minimize the total height of the strip needed. The authors propose approximation algorithms that produce a feasible packing by a sequence of Guillotine cuts. They also give a complete analysis of the quality of their approach.
0 references
cutting stock
0 references
strip packing
0 references
Guillotine cuts
0 references
packing problem
0 references
approximation scheme
0 references
worst case analysis
0 references
0.8609522581100464
0 references
0.8430711627006531
0 references
0.836784303188324
0 references
0.831793487071991
0 references
0.8241981863975525
0 references
