Solution of Сombinatorial Problems by the Method of Random Search Based on Factorial Numbers
Олексій Євгенійович Горячев, Алексей Евгеньевич Горячев, Oleksii Yevheniiovych Horiachev · Electronic Sumy State University Institutional Repository (Sumy State University) · 2018
Permutations are widely used in solving many combinatorial problems [1]. Permutations are an ordered set of different elements, each of which is represented by a number. In the course of solving a combinatorial problem, it is usually necessary to search through all the permutations with a certain number of elements. Each of the permutations will participate in the calculation of one of the possible solutions to the problem. Then the most effective solution will be chosen according to a predetermined criterion.