2 citations · 3 across the 9 of their papers we have counts for
1 paper · 1 filter
Andrej Brodnik, Bengt J. Nilsson, Gordana Vujović
The online bin covering problem is: given an input sequence of items find a placement of the items in the maximum number of bins such that the sum of the items' sizes in each bin i…