1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Joan Boyar, Lene M. Favrholdt, Shahin Kamali +1
The bin covering problem asks for covering a maximum number of bins with an online sequence of n items of different sizes in the range (0,1]; a bin is said to be covered if it…