CP is a very declarative technique for solving combinatorial optimization problems. This course is an introduction oriented for practitioners who wants to solve problems with CP. We will discuss how to build efficient CP models and what is happening behind the scene inside a CP solver. The more theoretical presentations will be interleaved with practical implementation exercises using the OscaR open source solver. OscaR is implemented in Scala (a modern Java) but no particular knowledge of Scala is required to follow this course and participate to exercises. Bring your laptop with you to take part to exercises. 

Important dates: Thursday 23 and Thursday 30 may,

Register here: http://www.info.ucl.ac.be/~pschaus/cpintro.html

• Michele Lombardi (University of Bologna)
• Pierre Schaus (UCL)