# Bin packing problem

Partition a set of integers, $LaTeX: \{c_1, \ldots, c_n\}$, into bins such that the sum of all integers in each bin does not exceed the bin capacity, say $LaTeX: b$, so as to minimize the number of bins required. The problem is NP-hard.