Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
The Backpack Problem
Graph Chatbot
Related lectures (30)
Previous
Page 2 of 3
Next
Dynamic Programming: Knapsack
Explores dynamic programming for the Knapsack problem, discussing strategies, algorithms, NP-hardness, and time complexity analysis.
Discrete Optimization: The Curse of Dimensionality
Delves into the curse of dimensionality in discrete optimization, highlighting the challenges of exponential computational time growth with problem size.
Optimization: Classical Problems
Covers classical optimization problems, brute force algorithms, and integer linear optimization.
Quasi-newton optimization
Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Algorithmes: introduction
Covers the basics of algorithms, problem-solving, and efficient resolution methods.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
Integer Optimization: Theory and Applications
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Traveling Salesman Problem: Introduction and Approximation Methods
Introduces the Traveling Salesman Problem and explores approximation methods using Markov chains.
