Theme

This lecture has been given in October 2010 at the Computational Intelligence and Learning doctoral school and May 2012 at the University of Málaga (at Faculty of Telecommunication Engineering). It is a three to five hours introduction to deterministic annealing as a general framework for combinatorial optimization. The course is self contained, but some background in optimization and probabilities is needed.

Slides

The slides are available here.

References

The course is based on my research work and on the excellent survey about deterministic annealing written by Kenneth Rose. Papers available online include: