[For the entire collection see Zbl 0547.00052.]
This bibliography concentrates on three types of probabilistic analyses in combinatorial optimization: running time analysis, error analysis and value analysis. Review results are given on problems of finding matchings in graphs, stable sets, colorings, Hamiltonian cycles in random graphs, optimal assignments, shortest traveling salesman tours, location and routing problems in Euclidean space, surveys on the average behavior of variants of the simplex method for linear programming. Results on non- Euclidean packing and covering problems are collected. Finally, branch- and-bound and search techniques for solving hard problems are discussed.