Probabilistic analysis of algorithms for dual bin packing problems
In the dual bin packing problem, the objective is to assign items of given size to the largest possible number of bins, subject to the constraint that the total size of the items assigned to any bin is at least equal to 1. We carry out a probabilistic analysis of this problem under the assumption that the items are drawn independently from the uniform distribution on [0, 1] and reveal the connection between this problem and the classical bin packing problem as well as to renewal theory.
Year of publication: |
1991-06-01
|
---|---|
Authors: | Csirik, J. ; Frenk, Frenk, J.B.G. ; Galambos, G. ; Rinnooy Kan, Rinnooy Kan, A.H.G. |
Institutions: | Faculteit der Economische Wetenschappen, Erasmus Universiteit Rotterdam |
Saved in:
freely available
Extent: | application/pdf |
---|---|
Series: | Econometric Institute Research Papers. - ISSN 1566-7294. |
Type of publication: | Book / Working Paper |
Notes: | The text is part of a series RePEc:ems:eureir |
Source: |
Persistent link: https://www.econbiz.de/10010837833
Saved in favorites
Similar items by person
-
A probabilistic analysis of the next fit decreasing bin packing heuristic
Csirik, J., (1986)
-
Order statistics and the linear assignment problem
Frenk, Frenk, J.B.G., (1987)
-
The asymptotic behaviour of a distributive sorting method
van Dam, W.B., (1983)
- More ...