Problem: MULTIPLE KNAPSACK: Given n objects, each with a value v_i and a weight w_i, and k knapsacks, each with capacity C, assign objects to the knapsacks so that the total weight of the objects in each does not exceed C and the total value of all the selected objects is maximized.

Can anyone give a program in c++, java or python design that implement a simple heursistic to solve this problem, an example of a simple heursist is a greedy aglorthim.