Greedy knapsack algorithm will work fine in this case as in each bin n1s1+n2s2+..nrsr<=C gives the optimal solution...........
On Sat, Oct 29, 2011 at 4:34 AM, SAMMM <[email protected]> wrote: > Suppose u 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. > > -- > 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.
