Anonymous user
Talk:Knapsack problem/Unbounded: Difference between revisions
→Dynamic Python solution
(→Dynamic Python solution: Another example.) |
|||
Line 18:
::I found [[http://razvi.wordpress.com/2008/10/09/dynamic-programming-integer-knapsack/ this]] to help work out what the dyunamic solution looks to do. --[[User:Paddy3118|Paddy3118]] 18:06, 5 January 2009 (UTC)
:::Note however that that page addresses a slightly different problem; the "0-1" problem, where you can take at most 1 of each item. Whereas in the problem here we can take as many of each item as we want. --[[User:Spoon!|Spoon!]] 02:48, 6 January 2009 (UTC)
| |||