Combinatorial Optimization Courses and Certifications

Simons Institute

The Short-Path Algorithm for Combinatorial Optimization

Explore the Short-path Algorithm's applications in combinatorial optimization, focusing on quantum computation challenges and potential solutions.

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

Institute for Pure & Applied Mathematics (IPAM)

Decision-Focused Learning - Integrating Downstream Combinatorics in ML

Explore the integration of machine learning and discrete optimization to enhance problem-solving in real-world scenarios, focusing on decision-focused learning and tailored solution strategies.

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

Institute for Pure & Applied Mathematics (IPAM)

Structured ML Training via Conditional Gradients

Explore conditional gradient methods for structured optimization in machine learning, covering applications in traditional and deep learning, with a focus on incorporating polyhedral structures into solutions.

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

International Mathematical Union

Polyhedral Techniques in Combinatorial Optimization: Matchings and Tours

Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.

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

Hausdorff Center for Mathematics

Panorama of Mathematics - A Panoramic Tour Through Combinatorial Optimization

Explore combinatorial optimization with Michel Goemans in this insightful lecture, covering new trends, results, and challenges in mathematical sciences.

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

Hausdorff Center for Mathematics

Non TDI Optimization with Supermodular Functions

Explores supermodular covering theorem's applications in non-TDI graph optimization, including degree-constrained problems, connectivity augmentation, and extensions of disjoint arborescences theorem.

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

Hausdorff Center for Mathematics

Combinatorial Polynomial Algorithms for Skew Bisubmodular Function Minimization

Explores combinatorial polynomial algorithms for skew-bisubmodular function minimization, extending previous work on bisubmodular functions and introducing new concepts in graph theory and optimization.

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

Hausdorff Center for Mathematics

Linear Matroid Matching in the Oracle Model

Explores linear matroid matching in the oracle model, replacing linear algebraic computation with repeated oracle-calls along alternating paths to solve challenging problems in connectivity, rigidity, and count matroids.

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

Hausdorff Center for Mathematics

Comparing Polyhedral Relaxations via Volume

Explore polyhedral relaxations in combinatorial optimization through volume calculations, examining fixed-charge problems and trilinear monomials for practical spatial branch-and-bound implementation guidance.

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

Simons Institute

Noncommutativity and Rounding Schemes for Combinatorial Optimization

Explore noncommutativity and rounding schemes in combinatorial optimization, focusing on quantum optimization techniques and their applications in solving complex problems.

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

Association for Computing Machinery (ACM)

Faster Energy Maximization for Faster Maximum Flow

Explore advanced techniques for solving maximum flow problems in undirected graphs, focusing on energy maximization and weight reduction strategies to improve algorithmic efficiency.

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

Simons Institute

Minimum Isolating Cuts - A New Tool for Solving Minimum Cut Problems

Explore a powerful new tool for solving minimum cut problems in combinatorial optimization, with applications to global, Steiner, and all-pairs min-cut algorithms.

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

Hausdorff Center for Mathematics

Polyhedral Techniques in Combinatorial Optimization - Matchings and Tours

Explore recent advancements in combinatorial optimization, focusing on matching and traveling salesman problems. Learn about polyhedral techniques and linear programming formulations for designing efficient algorithms.

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

Hausdorff Center for Mathematics

Formalising the Theory of Combinatorial Optimisation

Explore formalisation of combinatorial optimisation theory in Isabelle/HOL, focusing on matching theory and its mathematical implications for computer science and applied mathematics.

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

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)