Algorithms for the one-dimensional two-stage cutting stock problem (Q724047)
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: Algorithms for the one-dimensional two-stage cutting stock problem |
scientific article; zbMATH DE number 6910081
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for the one-dimensional two-stage cutting stock problem |
scientific article; zbMATH DE number 6910081 |
Statements
Algorithms for the one-dimensional two-stage cutting stock problem (English)
0 references
25 July 2018
0 references
cutting
0 references
two-stage cutting stock problem
0 references
column-and-row generation
0 references
problems with column-dependent-rows
0 references
0 references
0 references
0 references
0.92415154
0 references
0.9205238
0 references
0.9194393
0 references
0.9169383
0 references
0.9088326
0 references
0.90861773
0 references
0.9076507
0 references
