Knapsack Problem Courses and Certifications

Simons Institute

A Nearly-Linear Time Algorithm for Submodular Maximization with a Knapsack Constraint

Learn discrete optimization via continuous relaxation in a nearly-linear time algorithm for submodular maximization with a knapsack constraint from Simons Institute.

• YouTube
• 33 minutes
• On-Demand
• Free Online Course

Introduction to Computational Thinking and Data Science

31 reviews

MIT's 9-week course on computational thinking and data science. Learn Python programming, dynamic programming, Monte Carlo simulations, and more. Requires 14-16 hours/week.

• edX
• 9 weeks, 14-16 hours a week
• On-Demand
• Free Online Course (Audit)

• Best of All Time

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1249 ratings at Coursera

The primary topics in this part of the specialization are: greedy algorithms (scheduling, minimum spanning trees, clustering, Huffman codes) and dynamic programming (knapsack, sequence alignment, optimal search trees).

• Coursera
• 15 hours 29 minutes
• On-Demand
• Free Online Course (Audit)

École normale supérieure

Approximation Algorithms Part I

542 ratings at Coursera

Explore approximation algorithms with École normale supérieure's 5-week course. Learn to design solutions for NP-hard combinatorial optimization problems using linear programming.

• Coursera
• 1 day 11 hours 38 minutes
• On-Demand
• Free Online Course (Audit)

Recursion, Backtracking and Dynamic Programming in Python

886 ratings at Udemy

Learn Competitive Programming, Recursion, Backtracking, Divide and Conquer Methods and Dynamic Programming in Python

• Udemy
• 15 hours 47 minutes
• On-Demand
• Paid Course

Dynamic Programming

Master dynamic programming with this 3-4 hour material, covering topics from data structures to algorithms, and solving problems like knapsack and subset sum.

• YouTube
• 3 hours 30 minutes
• On-Demand
• Free Online Course

Simons Institute

Using Lattices for Cryptanalysis

Explore cryptanalysis with lattices, featuring practical applications like breaking classical crypto and attacking NTRU, in this 1-2 hour material from Simons Institute.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Online Course

Simons Institute

Algorithmic Mechanism Design with Investment

Explore algorithmic mechanism design with investment in this under 1-hour material from Simons Institute. Learn fast approximation algorithms for the knapsack problem, ensuring optimal welfare allocation.

• YouTube
• 49 minutes
• On-Demand
• Free Online Course