A storage-size selection problem (Q795502)
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 storage-size selection problem |
scientific article; zbMATH DE number 3862430
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A storage-size selection problem |
scientific article; zbMATH DE number 3862430 |
Statements
A storage-size selection problem (English)
0 references
1984
0 references
In the usual bin packing problem one is given a set of pieces and a bin size and the objective is to minimize the number of bins used to pack the pieces. This is equivalent to finding a packing with the least wasted space. This paper investigates the question of what can be done if, in addition, one is allowed to choose the bin size (which must be the same for all bins). How should one compute the best bin size, \(\alpha\), and the best packing into bins of this size to minimize wasted space?
0 references
bin packing
0 references
approximation algorithms
0 references
worst-case analysis
0 references
0.8287606835365295
0 references
0.7965688109397888
0 references
0.7924801111221313
0 references
0.7923329472541809
0 references
0.7709278464317322
0 references
