A maximum caving degree algorithm for three-dimensional rectangular packing (Q5320592)
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 5584942
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A maximum caving degree algorithm for three-dimensional rectangular packing |
scientific article; zbMATH DE number 5584942 |
Statements
22 July 2009
0 references
NP-hard problem
0 references
cutting and packing
0 references
heuristic algorithm
0 references
caving degree
0 references
three-dimensional rectangular packing
0 references
0.8747637867927551
0 references
0.8569521903991699
0 references
0.8538506031036377
0 references
0.8354359269142151
0 references
0.8302872776985168
0 references
