In this case, an instance is a final set of rational numbers (a1, ..., an) whose value is between O and 1.
So the solution to this problem is a partition of the set I into k bins such that the sum of the numbers in each bin is at most 1.
Finally the measure of the solution is the number of bins we use. Of course we want to use the minimum number of bins in order to pack our object.
