Главная
Study mode:
on
You
History
Saved
In progress 0 courses
compleat 0 courses
#Art & Design #Adobe #ChatGPT #GitHub

#Knapsack Problem

Showing: 9 courses

Dynamic Programming

0 rewiews
Explore dynamic programming techniques for solving complex algorithmic problems efficiently, including coin change, knapsack, and longest common subsequence.
Add to list
8 Lesons
3 hours 30 minutes
On-Demand
Free-Video
Simons Institute

Using Lattices for Cryptanalysis

0 rewiews
Explore lattice-based cryptanalysis techniques, including Coppersmith's method and attacks on NTRU, with applications to breaking classical cryptography and solving mathematical problems.
Add to list
11 Lesons
1 hour 4 minutes
On-Demand
Free-Video
Simons Institute

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

0 rewiews
Explore efficient algorithms for submodular maximization with knapsack constraints, focusing on nearly-linear time solutions and their applications in discrete optimization.
Add to list
1 Lesons
33 minutes
On-Demand
Free-Video
Simons Institute

Algorithmic Mechanism Design with Investment

0 rewiews
Explore approximation algorithms for knapsack problems, focusing on allocation efficiency and investment incentives in mechanism design without confirming negative externalities.
Add to list
1 Lesons
49 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

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

0 rewiews
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.
Add to list
1 Lesons
33 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

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

0 rewiews
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.
Add to list
1 Lesons
29 minutes
On-Demand
Free-Video
Sundeep Saradhi Kanthety

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

0 rewiews
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.
Add to list
1 Lesons
23 minutes
On-Demand
Free-Video
GERAD Research Center

Fast Exact Algorithms for Interdiction Problems - Coffee Talk

0 rewiews
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.
Add to list
1 Lesons
48 minutes
On-Demand
Free-Video
Institut des Hautes Etudes Scientifiques (IHES)

Contextual Stochastic Bandits with Budget Constraints and Fairness Application

0 rewiews
Explore contextual stochastic bandits, budget constraints, and fairness applications in machine learning. Learn strategies for balancing exploration and exploitation in reward maximization.
Add to list
1 Lesons
47 minutes
On-Demand
Free-Video