As Raidl [4] mentioned, MCPP comprises similarities to the knapsack problem and the bin packing problem. But, MCPP has much more difficulty in the context that it must solve two dependent parts simultaneously: (a) select items for packing, and (b) distribute chosen items over available
containers. Thus, MCPP also belongs to the family of NPhard problems, meaning that it is ever unlikely that we ever can devise polynomial algorithms to solve it exactly.