Combinatorial Optimization Courses and Certifications

Approximation Algorithms and Linear Programming

56 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
• 1 day 22 hours 18 minutes
• On-Demand
• Paid Course

École normale supérieure

Approximation Algorithms Part II

46 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 11 hours 30 minutes
• On-Demand
• Paid Course

GERAD Research Center

An AI Approach to Underspecified Combinatorial Optimisation Problems

Explore AI approaches for underspecified combinatorial optimisation problems, including decision-focused learning, preference learning, explainable constraint solving, and LLM-based modeling support tools.

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

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

Quantum Optimization (with IBM Quantum)

Explore quantum computing approaches to solve complex combinatorial optimization problems using IBM Quantum technology and learn specialized algorithms for industry applications.

• openHPI
• 2 weeks
• On-Demand
• Free Online Course

NPTEL-NOC IITM

State Space Search: Problem-Solving Approaches and Examples

Explore problem-solving techniques through state space search, from simple puzzles to complex real-world scenarios.

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

Simons Institute

Berkeley in the 80s - Richard Karp and the Theory of Computing

In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.

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

Simons Institute

Embedding as a Tool for Algorithm Design

Explore embedding algorithms for structured data prediction, combinatorial optimization, and dynamic network processes. Learn innovative approaches to algorithm design using latent variable models and mean field techniques.

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

Institute for Pure & Applied Mathematics (IPAM)

Task Structure and Generalization in Graph Neural Networks

Explore graph neural networks' generalization properties, focusing on the interplay between task structure and architectural biases for improved learning and performance in algorithmic tasks.

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

Institute for Pure & Applied Mathematics (IPAM)

Reasoning on Natural Inputs

Explore neural algorithmic reasoning for natural inputs, bridging classical algorithms with deep learning to solve real-world problems more effectively in reinforcement learning environments.

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

Institute for Pure & Applied Mathematics (IPAM)

The Transformer Network for the Traveling Salesman Problem

Explore how Transformer networks can tackle the Traveling Salesman Problem, improving upon existing heuristics with promising results for combinatorial optimization challenges.

• YouTube
• 30 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

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

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

Institut des Hautes Etudes Scientifiques (IHES)

Mathematical Foundation of Various MCMC Methods

Explore advanced MCMC methods for combinatorial optimization, including multi-spin flip techniques. Compare mathematical and numerical results to evaluate efficiency in different contexts.

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