Probabilistic analysis of algorithms for dual bin packing problems
June 1991
Article
pp 189-203.
This publication is part of collection
| Related Files |
|---|
View PDF Version
(Probabilistic_Analysis_of_Algorithms.pdf, 0.6MB) |
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.
Automatically Extracted Terms
- problem
- heuristic
- result
- solution value
- number
- pairing heuristic
- value
- solution
- distribution
- section
- renewal
- nfd heuristic
- item sizes
- csirik
- theory
- renewal theory
- pairing
- nf heuristic
- n items
- analysis
