Monte Carlo solution of combinatorial optimization problems

被引:3
|
作者
Rashkovskiy, S. A. [1 ]
机构
[1] Russian Acad Sci, Ishlinskii Inst Problems Mech, Moscow 119526, Russia
关键词
D O I
10.1134/S106456241606020X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
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.
引用
收藏
页码:720 / 724
页数:5
相关论文
共 50 条