The problem I have is like this bin packing problem, but instead I have $n$ bins and a collection of items with discrete masses. I need to put at least $m$ kg of stuff in each bin.Is there an efficient way of doing this? Is there a way that will assure there is approximately the same amount in each bin? Does having a good guess at the probability distribution of the masses help?More explicitly:I have $q$ objects $\{o_1...o_q\}$, each has a size $w(o_i) \in \mathbb{N}$.I need to find a collection of $n$ disjoint bins $B = \{b_1...b_n\}$ containing the objects such that$$\forall b_i \in B: \sum_{o \in b_i}w(o) > m$$for some $m$. When it is possible that is.
Relaxed Bin Packing Problem
algorithms;efficiency;packing