We discuss constraint programming, an approach to solve discrete optimization problems, and illustrate how it works with a scheduling code example implemented in Python with the CP-SAT solver.

Integer Linear Programming