Constraint Programming Courses and Certifications

Institute for Pure & Applied Mathematics (IPAM)

Prediction + Optimisation - Without and With Decision-Focused Learning

Explore AI-enhanced combinatorial optimization, including preference learning, decision-focused learning, and explanation generation. Discover CPMpy, a modern constraint programming language integrating multiple solving paradigms with machine learning.

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

Toronto Machine Learning Series (TMLS)

Using Constraint Programming to Improve Grocery Picking Efficiency at Loblaws

Explore constraint programming techniques to optimize grocery picking efficiency, reduce costs, and improve profitability in online retail operations.

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

ACM SIGPLAN

Goals as Constraints: Writing miniKanren Constraints in miniKanren

Explore an extension to miniKanren allowing goals to run as constraints, enhancing expressiveness and efficiency in relational programming.

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

ANITI Toulouse

Solving Scheduling Problems with Constraint Programming and Graph Neural Networks

Explore innovative approaches combining constraint programming and graph neural networks to tackle complex scheduling challenges.

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

Simons Institute

Computing Small Rainbow Cycle Numbers with SAT Modulo Symmetries

Explores computing rainbow cycle numbers using SAT modulo Symmetries, enhancing understanding of envy-freeness in fair division of indivisible goods and improving EFX allocation feasibility guarantees.

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

Discrete Optimization

12 reviews

Learn how to solve complex search problems using discrete optimization concepts and algorithms in this 8-week course from the University of Melbourne.

• Coursera
• 2 days 17 hours 10 minutes
• On-Demand
• Free Online Course (Audit)

University of Melbourne;  The Chinese University of Hong Kong

Solving Algorithms for Discrete Optimization

42 ratings at Coursera

Explore advanced solving techniques for discrete optimization problems, enhancing modeling skills and solver selection. Learn constraint programming, mixed integer programming, and local search methods.

• Coursera
• 22 hours 12 minutes
• On-Demand
• Free Online Course (Audit)

Constraint Programming

1 review

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
• On-Demand
• Free Online Course (Audit)

This class is designed to be hands-on, and we will be using several Python frameworks against CTF challenges: a binary analysis framework called angr and a SMT solver called z3.

• Independent
• On-Demand
• Free Online Course

NDC Conferences

Building AI Solutions with Google OR-Tools

Learn to build AI solutions using Google OR-Tools for optimization problems. Explore constraint programming, linear programming, and mixed-integer programming through practical examples like Sudoku and scheduling.

• YouTube
• 1 hour 4 minutes
• On-Demand
• Conference Talk

JSConf

Constraint Programming in the Browser

Explore constraint programming in JavaScript using Cassowary, enabling dynamic relationships between variables for innovative browser applications.

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

Institute for Pure & Applied Mathematics (IPAM)

Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization

Explore a hybrid approach combining reinforcement learning and constraint programming for solving complex combinatorial optimization problems, with applications in various fields.

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

The Julia Programming Language

Interval Methods for Scientific Computing in Julia

Explore interval methods for scientific computing in Julia, focusing on constraint propagation, global optimization, and root finding using IntervalConstraintProgramming.jl and IntervalArithmetic.jl packages.

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

GOTO Conferences

Propagators Part 1

Explore algorithms for information propagation, including CRDTs, Datalog, and SAT solving. Learn about Sussman and Radul's propagators and Kuper's lattice variables, blending frameworks for consistent, terminating results.

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

GOTO Conferences

Propagators Part 2

Explores advanced concepts in propagator algorithms, blending frameworks to optimize termination and consistency in various computational domains like CRDTs, Datalog, and constraint programming.

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