1
In the classic bin-packing problem, we have to pack some positive integers into bins, such that the sum in each bin is at most some constant $B$, and subjet to this, the number of bins is minimum.
Suppose now that we relax the capacity constraint: we only require that the sum in each pair of bins...
