**algorithm - Bin Packing using Dynamic Programming - …**
https://stackoverflow.com/questions/13088849/bin-packing-using-dynamic-programming

Jun 17, 2016 · 1. Problem Statement: You have n1 items of size s1, n2 items of size s2, and n3 items of size s3. You'd like to pack all of these items into bins each of capacity C, such that the total number of bins used is minimized. My Solution: Bin(C,N1,N2,N3) = max{Bin(C-N1,N1-1,N2,N3)+N1 if N1<=C and N1>0, Bin(C-N2,N1,N2-1,N3)+N2 if N2<=C and N2>0, Bin(C …

**DA:** 26 **PA:** 100 **MOZ Rank:** 36 **Up or Down:** Up