Applying classical probability problems to combinatorial optimization landscapes

Dr. Colin Reeves School of Information Sciences, Coventry University

Some classical probability problems (including the 'birthday problem' and the 'coupon-collector's problem') turn out to have a direct application to inference about properties of combinatorial optimization landscapes. There is also a connection to mark/recapture methods in population studies in ecology.

After a description of the classical problems and some variations, some results of applying them to combinatorial optimization landscapes will be discussed.

Maintained by rbennett@cs.ucl.ac.uk