Probability limit theorems of classical combinatorial optimization problems

A review was given of the principal probability limit theorems of solutions to classical combinatorial optimization problems. The emphasis was on the travelling saleman problems, minimal spanning trees, matching and lengths of the longest increasing subsequences. Probability limit theorems surveyed mainly involved strong laws of large numbers, rates of convergence, convergence in distribution and large deviation principles. No proofs were given. Some of the main open problems were described.