Constraint Programming: A Practical Introduction
CP is a very declarative technique for solving combinatorial optimization problems.
This course is an introduction oriented for practitioners who want's 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.
Instructors:
- Michele Lombardi (University of Bologna)
- Pierre Schaus (UCL)
This is grascomp course, possible to ask for a certificat.
Where?:
- In UCL (auditorium sud06)
Topics Covered (subject to change):
Day1 (Basics) Thursday 23 may, 9h30-16h:
- Quick Scala intro
- CP = Pruning + Search
- Global Constraints
- Modeling
Day2 (A bit more advanced) Thursday 30 may, 9h30-16h:
- Solver implementation (trail, search, . . .)
- Implement your own constraint
- Make CP Scale with Large Neighborhood Search
- Scheduling with CP
- Hybridization with other techniques (OR, LS, MIP)
Subscription are closed