A storage-size selection problem (Q795502): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Fast algorithms for bin packing / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms / rank | |||
Normal rank | |||
Latest revision as of 13:16, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A storage-size selection problem |
scientific article |
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
