Knapsack Problem Courses and Certifications

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
• Self-Paced
• Free Video

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
• Self-Paced
• Free Video

Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming

1276 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
• Self-Paced
• Paid Course

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
• Self-Paced
• 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
• Self-Paced
• Free Video

Sundeep Saradhi Kanthety

Knapsack Problem Using Greedy Method - Optimization Problems in Design and Analysis of Algorithms

Master the Knapsack Problem using the Greedy Method algorithm, understanding its optimization approach and implementation for efficient problem-solving in Design and Analysis of Algorithms.

• YouTube
• 18 minutes
• Self-Paced
• Free Video

École normale supérieure

Approximation Algorithms Part I

558 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 12 hours 54 minutes
• Self-Paced
• Paid Course

Dynamic Programming – 0/1 Knapsack Problem Tutorial

Learn to solve the 0/1 Knapsack Problem using dynamic programming and C#. Covers problem overview, algorithm explanation, coding implementation, and output generation for optimal item selection.

• freeCodeCamp
• Self-Paced
• Free Video

Recursion, Backtracking and Dynamic Programming in Python

929 ratings at Udemy

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

• Udemy
• 15 hours 46 minutes
• Self-Paced
• Paid Course

The Design and Analysis of Algorithm Masterclass

661 ratings at Udemy

Algorithm & Data Structures will help you to Crack Coding Interviews (C/C++Java/Python) Learn Algorithm Data Structures

• Udemy
• 12 hours 33 minutes
• Self-Paced
• Paid Course

CodeHelp - by Babbar

Dynamic Programming Complete Course - Introduction to Advanced DP Concepts

Master dynamic programming through 38+ comprehensive problems covering memoization, tabulation, space optimization, and advanced techniques like knapsack, LIS, and string DP.

• YouTube
• 16 hours 24 minutes
• Self-Paced
• Free Video

Back To Back SWE

Dynamic Programming, Recursion, and Backtracking

Master dynamic programming, recursion, and backtracking through 23 algorithmic challenges including classic problems like N Queens, Sudoku solving, and coin change optimization.

• YouTube
• 6 hours 32 minutes
• Self-Paced
• Free Video

Julia Analysis for Beginners - Tutorial Series 02

Master data analysis fundamentals using Julia programming with hands-on projects covering statistics, visualization, DataFrames, and interactive tools.

• YouTube
• 7 hours 8 minutes
• Self-Paced
• Free Video

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
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Pseudopolynomial-Time Algorithms for Optimization Problems

Explore fine-grained complexity theory and best-possible algorithms for discrete optimization problems, focusing on Subset Sum and related challenges in theoretical computer science.

• YouTube
• 1 hour 1 minute
• Self-Paced
• Free Video