Combinatorial Optimization Courses and Certifications

Hausdorff Center for Mathematics

Provable Submodular Function Minimization via Fujishige Wolfe Algorithm

Explore submodular function minimization through the Fujishige-Wolfe algorithm, analyzing its convergence and implications for combinatorial optimization.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Maximizing Monotone Submodular Functions over the Integer Lattice

Explore advanced algorithms for maximizing monotone submodular functions on integer lattices, with applications in machine learning and combinatorial optimization.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

Reassembling Trees for the Traveling Salesman

Explore advanced approximation algorithms for traveling salesman problems, focusing on tree reassembly techniques to improve solutions beyond traditional methods.

• YouTube
• 31 minutes
• Self-Paced
• Free Video

Hausdorff Center for Mathematics

On Element Connectivity Preserving Graph Simplification

Explores element-connectivity in graph simplification, focusing on reduction techniques, algorithmic results, and applications in network design. Highlights open problems and submodularity properties for faster algorithms.

• YouTube
• 46 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Machine Learning Inside MIP Solvers - IPAM at UCLA

Explore machine learning applications in MIP solvers, focusing on cutting planes and numerical stability. Gain insights into enhancing solver performance for general MIP benchmarks.

• YouTube
• 52 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Integer Optimization for Predictive & Prescriptive Analytics in High Stakes Domains

Explore integer optimization techniques for developing interpretable, robust, and fair decision-tree models to assist high-stakes decision-making in social services and healthcare domains.

• YouTube
• 50 minutes
• Self-Paced
• Free Video

Institute for Pure & Applied Mathematics (IPAM)

Learning for Decision-Making Under Uncertainty - IPAM at UCLA

Explore data-driven methods for uncertainty in decision-making, including mean robust optimization and techniques to reshape uncertainty sets, with applications in portfolio optimization and inventory management.

• YouTube
• 49 minutes
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• 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
• Self-Paced
• Free Video

Simons Institute

Recent Progress on Submodular Function Minimization

Explore recent advancements in submodular function minimization algorithms, leveraging convex optimization methods to address open questions and improve efficiency in discrete optimization.

• YouTube
• 32 minutes
• Self-Paced
• Free Video

Simons Institute

Utilizing Structure in Combinatorial Solving and Reasoning

Efficient utilization of structure for combinatorial problem solving, focusing on treewidth measure and answer set programming. Explores runtime bounds, decomposition-guided reductions, and empirical results in hard reasoning modes.

• YouTube
• 40 minutes
• Self-Paced
• 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
• Self-Paced
• Free Video

Gemini Center on Quantum Computing

Community Detection by Simulated Bifurcation

Explore the quantum-inspired Simulated Bifurcation algorithm for community detection in complex networks, comparing its performance with quantum machines and traditional methods.

• YouTube
• 26 minutes
• Self-Paced
• Free Video

GERAD Research Center

A Study of the Set-Covering Polyhedron Through Tilting Vectors

Explore set-covering polyhedron through tilting vectors, linking facet study to inequality tilting theory. Learn about characterizing facet-defining inequalities and efficient tilting methods.

• YouTube
• 22 minutes
• Self-Paced
• Free Video