Monte Carlo solution of combinatorial optimization problems
- Авторы: Rashkovskiy S.1
-
Учреждения:
- Ishlinskii Institute for Problems in Mechanics
- Выпуск: Том 94, № 3 (2016)
- Страницы: 720-724
- Раздел: Control Theory
- URL: https://journals.rcsi.science/1064-5624/article/view/224670
- DOI: https://doi.org/10.1134/S106456241606020X
- ID: 224670
Цитировать
Аннотация
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.
Об авторах
S. Rashkovskiy
Ishlinskii Institute for Problems in Mechanics
Автор, ответственный за переписку.
Email: rash@ipmnet.ru
Россия, Moscow, 119526