1 paper
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…