Graduate Course: Modelling for Combinatorial Optimisation 11th and 12th of June (by Jean-Noël Monette)

The goal of this course is to learn the use of tools to solve hard combinatorial optimisation problems by first modelling them in a solver-technology-independent constraint modelling language and then using an off-the-shelf constraint solver, as opposed to designing an (approximation) algorithm from first principles.

More info here:

https://www.info.ucl.ac.be/~pschaus/modelling.html