Skip to main content
Department of Information Technology

CT Lectures & Slides

For administrative reasons, attendance at the first two-hour-lecture is mandatory: you must contact Pierre Flener if you cannot make it for a convincing case of force majeure, ideally in advance. Attendance at all other lectures as well as at the labs and lessons is highly recommended.

The main objective of lectures is to cover the required theoretical content of the course, illustrated by as many examples as possible. Attendance is highly recommended. The essential aspects (in the eyes of the main instructor) of the course will be pointed out. Common misunderstandings will be discussed. The slides are not self-contained at all: they are only a support for the lectures, but not equivalent to their much more detailed content, so you ought to take notes.

PhD students can study most of the material by themselves after the first few lectures, and are relieved of the assignment and exam duties in exchange for a more sophisticated project (possibly in connection with their PhD research).

There is no planned correspondence between the scheduled lectures and the topics of the course: a lecture may span two topics in the table below. Slides will be put online immediately before a lecture (but are not distributed in printed form), hence you can always figure out approximately where we currently are.

Topic Slides Extra Material Instructor
Introduction & Overview L01.pdf Pierre Flener
Gecode Primer L02.pdf Chapters 1, 2, 3, 8, 9 of Ref 0 (Read this now!) Pierre Flener
Basic Modelling L03.pdf Chapters 4, 6 of Ref 0 Pierre Flener
Consistency L04.pdf Appendix A of Ref 1 Pierre Flener
Propagation L05.pdf, L05b.pdf Chapter 2 of Ref 1; Ref 2 Pierre Flener
Search L06.pdf Chapter 3 of Ref 1; Chapter 7 of Ref 0 Pierre Flener
Global Constraints L07.pdf Pierre Flener
Modelling L08.pdf Ref 3 Pierre Flener
Set Variables L09.pdf Chapter 5 of Ref 0 Pierre Flener
distinct Propagation L10.pdf Ref 4; Ref 5 Pierre Flener
CT for Solving Configuration Problems ct_config.pdf Tacton Systems AB Tomas Axling
Linear and Nonlinear Programming optimization09.pdf Optimisation course Per Lötstedt
Constraint-Based Scheduling,
Constraint Logic Programming,
Concurrent Constraint Programming,
Constraint-Based Local Search,
Linear Programming,
Hybridisation;
Q & A
L11.pdf Pierre Flener

Many (but not all) of the slides are copyright Christian Schulte, Marco Kuhlmann, or Guido Tack.

Updated  2010-05-28 10:34:16 by Pierre Flener.