Inequalities for bin packing-III
- 1 January 1994
- journal article
- research article
- Published by Taylor & Francis in Optimization
- Vol. 29 (4) , 381-385
- https://doi.org/10.1080/02331939408843965
Abstract
Consider the minimum number of unit size bins needed to pack Items that are independently distributed according to a given distribution μ concentrated on [0,1]. We prove that for some universal constant $i;K$ei;. we haveKeywords
This publication has 5 references indexed in Scilit:
- Inequalities for Bin Packing—IIMathematics of Operations Research, 1993
- A Note on Optimal Bin Packing and Optimal Bin Covering with Items of Random SizeSIAM Journal on Computing, 1990
- Some inequalities for bin packingOptimization, 1989
- Martingale Inequalities and NP-Complete ProblemsMathematics of Operations Research, 1987
- Probability Inequalities for Sums of Bounded Random VariablesJournal of the American Statistical Association, 1963