Multidimensional 0-1 knapsack problem
 

Dear experts,

I've found a dynamic programming recursive formula for Multidimensional 0-1 knapsack problem, on the internet but unfortunately i am not able to implement it. I would be glad if You could show me the code of the problem or a pseudo code.

Thank You. :)