Slides for the whole semester in one file will be published at the end of the semester
Slides from the lectures and seminars in one file
The outline below is preliminary, and slides will be added during the semester
-
Base terminology, examples, complexity.
-
Graph representation. Arc consistency.
-
Path consistency, k-consistency.
-
Directional consistency, graph width, and polynomial CSPs. Generalized arc consistency and bound consistency.
-
Global constraints. Generalized consistency algorithm.
-
Look ahead.
-
Look back. Backmarking
-
Dynamic backtracking. Search strategies for scheduling.
-
Constraint propagation algorithms for scheduling.
-
Branch & bound. Incomplete search.
-
Local search.
-
Comparison of search algorithms. Revision lesson.
Exercise materials are initially available in a pre-exercise version. After both groups have completed the exercise, the full version will be posted, and source codes will be added to the initially broken links
-
Introduction to OPL
-
Global constraints
-
Modeling
-
Scheduling I
-
Scheduling II
-
Search
-
Introduction to OPL
-
Global constraints
-
Modeling
-
Scheduling I
-
Scheduling II
Previous