Dual bin packing with items of random sizes

Dual bin packing with items of random sizes

0.00 Avg rating0 Votes
Article ID: iaor19941809
Country: Netherlands
Volume: 58
Issue: 2
Start Page Number: 229
End Page Number: 242
Publication Date: Feb 1993
Journal: Mathematical Programming (Series A)
Authors: ,
Keywords: probability
Abstract:

Given a collection of items and a number of unit size bins, the dual bin packing problem requires finding the largest number of items that can be packed in these bins. In the present stochastic model, the item sizes equ1 are independent identically distributed according to a given probability measure equ2. Denote by equ3 the largest number of these items that can be packed in equ4 bins, where equ5 is a constant. The authors show that equ6 exists, and that the random variable equ7 converges in distribution. the limit is identified as the distribution of the supremum of a certain Gaussian process cannonically attached to equ8.

Reviews

Required fields are marked *. Your email address will not be published.