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 pseudo code. For me the formula is not clear and I don't know how do it (despite, i know classic single dimension 0-1 knapsack problem well) http://books.google.......ERmrs#PPA248,M1 (Page 248)
Thank You.

New Topic/Question
Reply



MultiQuote


|