An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196)
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 1829899
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container |
scientific article; zbMATH DE number 1829899 |
Statements
An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (English)
0 references
17 November 2002
0 references
3-dimensional packing
0 references
Pallet/container loading
0 references
Combinatorial optimization
0 references
Graph theory
0 references
0 references
0 references
0 references
0 references
0 references
0.7884471416473389
0 references
0.7883527874946594
0 references
0.7798550128936768
0 references
0.7786141037940979
0 references
