A new heuristic algorithm for the one-dimensional cutting stock problem (Q3589039)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5783052
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new heuristic algorithm for the one-dimensional cutting stock problem |
scientific article; zbMATH DE number 5783052 |
Statements
10 September 2010
0 references
cutting stock problem
0 references
bin packing problem
0 references
subset-sum problem
0 references
dynamic programming
0 references
heuristic algorithm
0 references
0.8416895866394043
0 references
0.840082049369812
0 references
0.8371555805206299
0 references
0.8348159193992615
0 references
0.8294863700866699
0 references
