Knapsack Problem Courses and Certifications

Simons Institute

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

Explore efficient algorithms for submodular maximization with knapsack constraints, focusing on nearly-linear time solutions and their applications in discrete optimization.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

0/1 Knapsack Problem Using Least Cost Branch and Bound - Design and Analysis of Algorithms

Learn to solve the 0/1 Knapsack problem using Least Cost Branch and Bound method, with a step-by-step example demonstrating the algorithm's application in Design and Analysis of Algorithms.

• YouTube
• 23 minutes
• On-Demand
• Free Video

Introduction to Computational Thinking and Data Science

30 reviews

6.00.2x is an introduction to using computation to understand real-world phenomena.

• 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

1262 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
• 14 hours 41 minutes
• On-Demand
• Free Online Course (Audit)

Approximation Algorithms Part I

552 ratings at Coursera

Explore approximation algorithms for NP-hard problems using linear programming and randomized rounding techniques. Learn to design efficient solutions with provable guarantees for combinatorial optimization challenges.

• Coursera
• 1 day 9 hours 54 minutes
• On-Demand
• Free Online Course (Audit)

Recursion, Backtracking and Dynamic Programming in Python

901 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

Simons Institute

Using Lattices for Cryptanalysis

Explore lattice-based cryptanalysis techniques, including Coppersmith's method and attacks on NTRU, with applications to breaking classical cryptography and solving mathematical problems.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Free Video

Dynamic Programming

Explore dynamic programming techniques for solving complex algorithmic problems efficiently, including coin change, knapsack, and longest common subsequence.

• YouTube
• 3 hours 30 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

0/1 Knapsack Problem Using Dynamic Programming - Design and Analysis of Algorithms

Learn to solve the 0/1 Knapsack problem using dynamic programming. Master this classic algorithm optimization technique for efficient decision-making in resource allocation scenarios.

• YouTube
• 33 minutes
• On-Demand
• Free Video

Sundeep Saradhi Kanthety

0/1 Knapsack Problem Using FIFO Branch and Bound - Design and Analysis of Algorithms

Comprehensive tutorial on solving the 0/1 Knapsack problem using FIFO Branch and Bound method, with practical examples and step-by-step explanations for efficient algorithm implementation.

• YouTube
• 29 minutes
• On-Demand
• Free Video

GERAD Research Center

Fast Exact Algorithms for Interdiction Problems - Coffee Talk

Explore fast exact algorithms for interdiction problems, focusing on knapsack and minimum spanning tree variants. Learn about Stackelberg games and branch-and-bound techniques for optimization.

• YouTube
• 48 minutes
• On-Demand
• Free Video

GERAD Research Center

Data-Driven Method for Constraint Customization in Optimization Models

Explore data-driven constraint customization in optimization models using machine learning to extract and incorporate implicit operational rules, enhancing decision-making in various industries.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Simons Institute

Algorithmic Mechanism Design with Investment

Explore approximation algorithms for knapsack problems, focusing on allocation efficiency and investment incentives in mechanism design without confirming negative externalities.

• YouTube
• 49 minutes
• On-Demand
• Free Video

Institut des Hautes Etudes Scientifiques (IHES)

Contextual Stochastic Bandits with Budget Constraints and Fairness Application

Explore contextual stochastic bandits, budget constraints, and fairness applications in machine learning. Learn strategies for balancing exploration and exploitation in reward maximization.

• YouTube
• 47 minutes
• On-Demand
• Free Video