A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (Q296576)
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 fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem |
scientific article; zbMATH DE number 6597399
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem |
scientific article; zbMATH DE number 6597399 |
Statements
A fast algorithm for identifying minimum size instances of the equivalence classes of the pallet loading problem (English)
0 references
23 June 2016
0 references
packing
0 references
pallet loading problem
0 references
equivalence class
0 references
0 references
0 references
0 references
0 references
0 references
0.8647639751434326
0 references
0.7705314755439758
0 references
0.7696568965911865
0 references
0.7440463304519653
0 references
0.7297508120536804
0 references
