Anonymous user
Knapsack problem/Unbounded/Python dynamic programming: Difference between revisions
Knapsack problem/Unbounded/Python dynamic programming (view source)
Revision as of 06:20, 6 June 2010
, 13 years ago→DP, multiple size dimensions: (spelling)
m (→DP, multiple size dimensions: (spelling)) |
|||
Line 76:
====DP, multiple size dimensions====
Our original problem has two dimensions to 'size': weight and volume. We can create a python size object, that
<lang python>from knapsack_sizer import makesize
|