Partition a set of integers, , into bins such that the sum of all integers in each bin does not exceed the bin capacity, say , so as to minimize the number of bins required. The problem is NP-hard.

Category: MIP/CO