An instance of the classical bin packing problem consists of a positive real C and a list L = (a1, a2, ..., an) of items with sizes 0 < s(ai) ≤ C, 1 ≤ i ≤ n; a solution to the problem is a partition of L into a minimum number of blocks, called bins, such that the sum of the sizes of the items in each bin is at most the capacity C. The capacity is just a scaling parameter; as is customary, we pu...
