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
Optimization Algorithms: Greedy Approach
Graph Chatbot
Related lectures (31)
Previous
Page 1 of 4
Next
Optimization Problems: Greedy Algorithms
Explores optimization problems and greedy algorithms to find the best solutions efficiently.
Optimisation Algorithms: Greedy Approach
Explores optimization problems solved with greedy algorithms and proves the optimality of the Cashier's Algorithm for U.S. coins.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Dynamic Programming: Fibonacci Numbers
Covers dynamic programming with a focus on Fibonacci numbers and the rod cutting problem.
Dynamic Programming: Fibonacci Numbers
Covers dynamic programming with a focus on Fibonacci numbers and efficient calculation algorithms.
Convex Optimization Tutorial: KKT Conditions
Explores KKT conditions in convex optimization, covering dual problems, logarithmic constraints, least squares, matrix functions, and suboptimality of covering ellipsoids.
Optimal Decision Making: Exercises and Applications
Covers exercises on optimal decision making, including minimizing costs and optimizing transportation networks.
Dynamic Programming: Rod Cutting and Matrix Chain Multiplication
Covers dynamic programming techniques for solving the rod cutting and matrix chain multiplication problems.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.