@atul007: the 0-1 knapsack is a special case of subset sum problem, (and.. i don't think its easy to find all the solutions using 0/1 knapsack.. )
@shady: is it possible? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/2xspry_EJxoJ. 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.
