A branch and bound algorithm for the strip packing problem (Q1017971)
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: A branch and bound algorithm for the strip packing problem |
scientific article; zbMATH DE number 5553506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for the strip packing problem |
scientific article; zbMATH DE number 5553506 |
Statements
A branch and bound algorithm for the strip packing problem (English)
0 references
13 May 2009
0 references
strip packing
0 references
non-guillotine cutting
0 references
branch and bound
0 references
lower bounds
0 references
0 references
0 references
0 references
0 references
0.9091745615005492
0 references
0.8967767357826233
0 references
0.884824275970459
0 references
0.8669038414955139
0 references
0.8424811959266663
0 references
