Knapsack Problem Courses
Massachusetts Institute of Technology via edX Approximation Algorithms Part I
École normale supérieure via Coursera Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Stanford University via Coursera Recursion, Backtracking and Dynamic Programming in Python
Udemy Dynamic Programming
YouTube Using Lattices for Cryptanalysis
Simons Institute via YouTube A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint
Simons Institute via YouTube Algorithmic Mechanism Design with Investment
Simons Institute via YouTube 0/1 Knapsack Problem Using Dynamic Programming - Design and Analysis of Algorithms
Sundeep Saradhi Kanthety via YouTube 0/1 Knapsack Problem Using Least Cost Branch and Bound - Design and Analysis of Algorithms
Sundeep Saradhi Kanthety via YouTube