Solution of Сombinatorial Problems by the Method of Random Search Based on Factorial Numbers

Horiachev, Oleksii Yevheniiovych; Moschna I.B., I.B.

Please use this identifier to cite or link to this item: http://essuir.sumdu.edu.ua/handle/123456789/67951

Or use following links to share this resource in social networks: Recommend this item

Title	Solution of Сombinatorial Problems by the Method of Random Search Based on Factorial Numbers
Authors	Horiachev, Oleksii Yevheniiovych Moschna I.B., I.B.
ORCID	http://orcid.org/0000-0002-4251-0813
Keywords	факторіальні номери факторные числа factorial numbers елементи элементы their elements випадковий пошук случайный поиск random search
Type	Conference Papers
Date of Issue	2018
URI	http://essuir.sumdu.edu.ua/handle/123456789/67951
Publisher	Sumy State University
License
Citation	Goryachev, A.E. Solution of Сombinatorial Problems by the Method of Random Search Based on Factorial Numbers [Текст] / A.E. Goryachev, I.B. Moschna // Фізика, електроніка, електротехніка: матеріали та програма науково-технічної конференції, м. Суми, 5-9 лютого 2018 р. / Відп. за вип. С.І. Проценко. – Суми: СумДУ, 2018. – С. 96.
Abstract	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.
Appears in Collections:	Наукові видання (ЕлІТ)