Combinatorial Optimization Courses and Certifications

Basic Modeling for Discrete Optimization

460 ratings at Coursera

Model discrete optimization problems in MiniZinc: solve knapsack, graph coloring and cryptarithm puzzles, model set selection, assignment and partition problems, and combine multiple viewpoints.

• Coursera
• 4 weeks, 7 hours a week
• Self-Paced
• Paid Course

Advanced Modeling for Discrete Optimization

143 ratings at Coursera

Debug and improve discrete optimization models in a high-level modeling language, encapsulate constraints in predicates, and tackle scheduling, packing, symmetry and dominance breaking.

• Coursera
• 5 weeks, 9 hours a week
• Self-Paced
• Paid Course

Solving Algorithms for Discrete Optimization

44 ratings at Coursera

Learn how discrete optimization solvers work: constraint propagation and search in MiniZinc, branch and bound, simplex and Gomory cuts, and local search with simulated annealing.

• Coursera
• 4 weeks, 5 hours a week
• Self-Paced
• Paid Course

Ryan O'Donnell

The SDP Relaxation for Max-Cut - Lecture 19b of CS Theory Toolkit

Learn how semidefinite programming relaxes the Max-Cut problem into an efficiently solvable infinite linear program.

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

Unleashing the Power of Discrete Optimization in the New Era of AI

Explore cutting-edge discrete optimization techniques and their applications in modern AI systems, focusing on Meta's innovative approaches and real-world implementation strategies.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

离散优化算法篇 Solving Algorithms for Discrete Optimization

聚焦用约束传播、分支限界、混合整数规划和局部搜索，高效求解复杂离散优化问题。

• Coursera
• 4 weeks, 7 hours a week
• Self-Paced
• Free Online Course

离散优化建模高阶篇 Advanced Modeling for Discrete Optimization

学习用高级 MiniZinc 建模、调试和改良复杂离散优化问题，涵盖调度、打包、谓词、对称性与支配。

• Coursera
• 5 weeks, 9 hours a week
• Self-Paced
• Free Online Course

Optimization: principles and algorithms - Network and discrete optimization

Introduction to network optimization and discrete optimization

• edX
• 5 weeks, 6-8 hours a week
• Self-Paced
• Free Online Course (Audit)

组合最优化

以线性规划及其对偶算法系统求解最大流、匹配、最小支撑树和整数规划等组合最优化问题。

• XuetangX
• Self-Paced
• Free Online Course

Delivery Problem

376 ratings at Coursera

Implement Python solutions to the travelling salesman problem: branch and bound, dynamic programming, and approximation algorithms with a 2-approximation guarantee.

• Coursera
• 3 weeks, 4 hours a week
• Self-Paced
• Paid Course

École normale supérieure

Approximation Algorithms Part I

558 ratings at Coursera

Design approximation algorithms for NP-hard problems: apply linear programming relaxation and randomized rounding to vertex cover, knapsack, bin packing, set cover, and multiway cut.

• Coursera
• 5 weeks, 7 hours a week
• Self-Paced
• Free Online Course

Advanced Intelligent Optimization and its Applications

Configure evolutionary algorithms, handle constraints and multiple objectives, and implement combinatorial optimization algorithms in Python for science and engineering design.

• Coursera
• 3 weeks, 5 hours a week
• Self-Paced
• Paid Course

École normale supérieure

Approximation Algorithms Part II

48 ratings at Coursera

Design approximation algorithms with linear programming duality: build primal-dual algorithms for Steiner forest and facility location, and apply semidefinite programming to Maximum Cut.

• Coursera
• 4 weeks, 9 hours a week
• Self-Paced
• Free Online Course

Approximation Algorithms

33 ratings at Coursera

Design and analyze approximation algorithms for NP-hard problems: approximation ratios, load balancing, LP relaxation for vertex cover, and polynomial-time approximation schemes for the knapsack problem.

• Coursera
• 4 weeks, 4 hours a week
• Self-Paced
• Paid Course

Constraint Programming

1 rating

Learn the basics of constraint programming from the implementation of solvers to modeling techniques for solving concrete combinatorial problems such as routing and scheduling.

• edX
• 14 weeks, 6-8 hours a week
• Self-Paced
• Free Online Course (Audit)