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
Set Cover: Integrality Gap
Graph Chatbot
Related lectures (24)
Previous
Page 1 of 3
Next
Approximation Algorithms
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Cartesian Product and Induction
Introduces Cartesian product and induction for proofs using integers and sets.
Proofs and Logic: Introduction
Introduces logic, proofs, sets, functions, and algorithms in mathematics and computer science.
Quasi-newton optimization
Covers gradient line search methods and optimization techniques with an emphasis on Wolfe conditions and positive definiteness.
Algorithms & Growth of Functions
Covers optimization algorithms, stable matching, and Big-O notation for algorithm efficiency.
Unweighted Bipartite Matching
Introduces unweighted bipartite matching and its solution using linear programming and the simplex method.
Optimization Methods: Theory Discussion
Explores optimization methods, including unconstrained problems, linear programming, and heuristic approaches.
Course Overview: Teaser on Course Contents
Offers an overview of propositional and predicate logic, sets, functions, relations, algorithms, Swiss cities, sorting tables, Covid infections, poker hands, and prime numbers.
Integer Optimization: Theory and Applications
Covers the fundamentals of integer optimization, including integer programming, dynamic programming, and approximation algorithms.
Sets and Proofs
Introduces sets in discrete mathematics and explores proof techniques like direct and indirect proofs.