another MIT dp problem without answer on their website.# JobHunting - 待字闺中
b*e
1 楼
Bin Packing (Simplified Version). 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.
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.