Combinatorial Optimization Courses and Certifications

Delivery Problem

372 ratings at Coursera

Implement efficient Python programs for the traveling salesman problem, exploring exact and approximation algorithms while applying discrete mathematics concepts.

• Coursera
• 13 hours 23 minutes
• On-Demand
• Free Online Course (Audit)

Approximation Algorithms and Linear Programming

35 ratings at Coursera

Explore linear and integer programming for optimal solutions in resource allocation, scheduling, and task assignment. Learn approximation algorithms for NP-hard problems with guaranteed performance bounds.

• Coursera
• 2 days 27 minutes
• On-Demand
• Free Online Course (Audit)

Approximation Algorithms Part I

552 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 9 hours 54 minutes
• On-Demand
• Free Online Course (Audit)

Approximation Algorithms Part II

44 ratings at Coursera

Explore advanced approximation algorithms using linear programming duality and semidefinite programming for combinatorial optimization problems like Steiner forest, facility location, and maximum cut.

• Coursera
• 1 day 8 hours 30 minutes
• On-Demand
• Free Online Course (Audit)

IIT Guwahati;  NPTEL

Computer Aided Applied Single Objective Optimization

Learn mathematical and computational intelligence algorithms for solving combinatorial optimization problems, with practical applications and state-of-the-art tools. Includes case study analysis.

• Swayam
• 12 weeks
• On-Demand
• Free Online Course

Strange Loop Conference

Dynamic Programming at Ease - With Grammars, Algebras, Products

Explore dynamic programming for combinatorial optimization problems using grammars, algebras, and products. Learn to efficiently solve complex problems by reusing intermediate results and reducing complexity.

• YouTube
• 37 minutes
• On-Demand
• Conference Talk

Association for Computing Machinery (ACM)

Asymmetric Traveling Salesman Problem: Advances and Challenges - Session 1A

Explore cutting-edge research on the Asymmetric Traveling Salesman Problem, including algorithms, lower bounds, and approximation results in this advanced theoretical computer science talk.

• YouTube
• 40 minutes
• On-Demand
• Free Video

Association for Computing Machinery (ACM)

Towards a Better Understanding of Randomized Greedy Matching

Explores randomized greedy matching algorithms, introducing Modified Randomized Greedy (MRG) and analyzing its performance in various graph scenarios, including weighted and oblivious matching.

• YouTube
• 23 minutes
• On-Demand
• Free Video

IEEE

Hypergraph K-Cut for Fixed K in Deterministic Polynomial Time

Explore deterministic polynomial-time algorithms for hypergraph k-cut problems, focusing on fixed k values. Learn about structural theorems, techniques, and open questions in this field.

• YouTube
• 28 minutes
• On-Demand
• Conference Talk

IEEE

Subexponential LPs Approximate Max-Cut

Explore subexponential linear programs for approximating Max-Cut, comparing LPs and SDPs, and examining refutation in pseudorandom graphs. Gain insights into combinatorial optimization techniques.

• YouTube
• 26 minutes
• On-Demand
• Conference Talk

Paul G. Allen School

Money, Circuits, Mythic Figures, and More - Theory in the Allen School

Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.

• YouTube
• 53 minutes
• On-Demand
• Free Video

Simons Institute

Spectral Aspects of Symmetric Matrix Signings

Explore symmetric matrix signings, their spectral aspects, and applications in graph theory, polynomial identity testing, and algorithmic problems.

• YouTube
• 30 minutes
• On-Demand
• Free Video

Simons Institute

Constructing Extended Formulations

Explore advanced techniques for constructing extended formulations in combinatorial optimization, focusing on polytopes, matchings, cycles, and spanning trees in various graph types.

• YouTube
• 1 hour 7 minutes
• On-Demand
• Free Video

International Centre for Theoretical Sciences

Robust Regression by Purushottam Kar

Explore robust regression techniques for learning and estimation in algorithms and optimization, focusing on practical applications and theoretical foundations.

• YouTube
• 47 minutes
• On-Demand
• Free Video

IEEE

Approximation Algorithms for Stochastic Minimum Norm Combinatorial Optimization

Explore advanced techniques for solving stochastic minimum norm combinatorial optimization problems, focusing on approximation algorithms and their applications in complex decision-making scenarios.

• YouTube
• 22 minutes
• On-Demand
• Free Video