Please enable JavaScript.
Coggle requires JavaScript to display documents.
Dynamic Programming, NP-hard problems, M16 - Coggle Diagram
Dynamic Programming
-
-
-
-
-
Knapsack problem
Given n items of known weights w1,...,wn and values v1,...,vn and a knapsack of capacity W, find the most valuable subset of the items that fit into the knapsack
-
-
-
-