Entry requirements

60 ECTS credits in science, technology,

systems science or linguistics, incl.

programming (12 credits) and basic algebra.

Aims

Constraint technology proposes a novel set of techniques

and tools for efficiently solving (hard) combinatorial problems.

Doing so is crucial in many application domains, such as scheduling,

planning, molecular biology, finance, and so on. Many (Swedish)

companies are successfully deploying constraint technology, making

knowledge thereof a marketable asset. This course combines coverage

of theoretical foundations with hands-on experience in modelling and

solving real-life combinatorial problems. The material presented is

orthogonal and complementary to operations research and local search

methods.

Content

The basics of constraints. Modelling problems in

terms of constraints. Constraint propagation and search.

Global constraints. Constraints for particular

applications: Resource scheduling, Routing, Geometry

and Regulation constraints. Optimisation.

Advanced solving techniques.

Instruction

Lectures, small exercises and a project.

Assessment

Written exam at the end of the course (3 p).

A project during the course (2 p).