Upper bounds for heuristic approaches to the strip packing problem (Q2806895)
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: Upper bounds for heuristic approaches to the strip packing problem |
scientific article; zbMATH DE number 6582506
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Upper bounds for heuristic approaches to the strip packing problem |
scientific article; zbMATH DE number 6582506 |
Statements
Upper Bounds for Heuristic Approaches to the Strip Packing Problem (English)
0 references
19 May 2016
0 references
three-dimensional case
0 references
upper bound
0 references
layer-relaxation
0 references
0.9667809009552002
0 references
0.8343729972839355
0 references
0.8295859694480896
0 references
0.8283443450927734
0 references
0.8209770321846008
0 references
