Monte Carlo solution of combinatorial optimization problems

Аннотация

A general method for solving combinatorial optimization problems based on the Metropolis algorithm is developed. The method is easy to implement, efficient, and universal. It can be applied to a broad class of poorly formalizable logical problems. An example is given of solving the problem of creating a class schedule by applying the Monte Carlo method.