hey which is similar to knapsack problem ,which we study design and analysis of algorithms
On Tue, Mar 15, 2011 at 3:51 PM, bittu <[email protected]> wrote: > 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. > > Thanks > Shashank > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
