Select one of the below options

1. [Knapsack, data.3]
2. [Knapsack, data.1, sorted]
3. [Knapsack, data.2, sorted]
4. [Knapsack, data.3, sorted, fractional knapsack]
5. [Knapsack, data.3, sorted, 0-1 knapsack]
6. [Bounds, data.3, U0]
7. [Bounds, data.3, U1]
8. [Bounds, data.3, U2]
9. [Bounds, data.3, U3]
10. [Branch-and-bound, data.3, primal, no bounds]
11. [Branch-and-bound, data.3, primal, U0]
12. [Branch-and-bound, data.3, primal, U1]
13. [Branch-and-bound, data.3, primal, U2]
14. [Branch-and-bound, data.3, primal, U3]
15. [Branch-and-bound, data.3, primal, greedy, U0]
16. [Branch-and-bound, data.3, primal, greedy, U1]
17. [Branch-and-bound, data.3, primal, greedy, U2]
18. [Branch-and-bound, data.3, primal, greedy, U3]
19. [Branch-and-bound, data.3, primal-dual, no bounds]
20. [Branch-and-bound, data.3, primal-dual, U0]
21. [Branch-and-bound, data.3, primal-dual, U1]
22. [Branch-and-bound, data.3, primal-dual, U2]
23. [Branch-and-bound, data.3, primal-dual, U3]
24. [Dynamic programming, data.3, primal, table, no bounds]
25. [Dynamic programming, data.3, primal, lists, no bounds]
26. [Dynamic programming, data.3, primal, lists, bound U0]
27. [Dynamic programming, data.3, primal, lists, bound U1]
28. [Dynamic programming, data.3, primal, lists, bound U2]
29. [Dynamic programming, data.3, primal, lists, bound U3]
30. [Dynamic programming, data.3, primal-dual, table, no bounds]
31. [Dynamic programming, data.3, primal-dual, lists, no bounds]
32. [Dynamic programming, data.3, primal-dual, lists, bound U0]
33. [Dynamic programming, data.3, primal-dual, lists, bound U1]
34. [Dynamic programming, data.3, primal-dual, lists, bound U2]
35. [Dynamic programming, data.3, primal-dual, lists, bound U3]
36. [Knapsack, data.3, sorted, 0-1 knapsack]
37. [Reduction, data.3, U0]
38. [Reduction, data.3, U1]
39. [Reduction, data.3, U2]
40. [Reduction, data.3, U3]
41. [Branch-and-bound, data.3, U0]
42. [Dynamic programming, data.3, lists, U0]

Would you like to open the Knapsack view?