A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248)
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 1741962
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A lower bound for the non-oriented two-dimensional bin packing problem |
scientific article; zbMATH DE number 1741962 |
Statements
A lower bound for the non-oriented two-dimensional bin packing problem (English)
0 references
15 May 2002
0 references
cutting and packing
0 references
lower bound
0 references
branch-and-bound
0 references
0 references
0.8847568035125732
0 references
0.8829699158668518
0 references
0.878250002861023
0 references
0.8627036213874817
0 references
0.8406623005867004
0 references
