A Packing Problem You Can Almost Solve by Sitting on Your Suitcase (Q3718472)
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 3947983
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Packing Problem You Can Almost Solve by Sitting on Your Suitcase |
scientific article; zbMATH DE number 3947983 |
Statements
A Packing Problem You Can Almost Solve by Sitting on Your Suitcase (English)
0 references
1986
0 references
approximation of solutions
0 references
bin-packing
0 references
machine scheduling
0 references
dual approximation algorithm
0 references
minimum makespan
0 references
0.8313170075416565
0 references
0.8131301403045654
0 references
0.8057683110237122
0 references
0.8053879737854004
0 references
0.8047239780426025
0 references
