Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705)
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: Exact algorithms for the guillotine strip cutting/packing problem. |
scientific article; zbMATH DE number 1975812
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for the guillotine strip cutting/packing problem. |
scientific article; zbMATH DE number 1975812 |
Statements
Exact algorithms for the guillotine strip cutting/packing problem. (English)
0 references
7 September 2003
0 references
branch-and-bound
0 references
combinatorial optimization
0 references
cutting and packing
0 references
dynamic programming
0 references
heuristics
0 references
0 references
0 references
0 references
0.8457375168800354
0 references
0.8386821150779724
0 references
0.8282858729362488
0 references
0.8252127170562744
0 references
0.8213802576065063
0 references
