browse.title.page

Зараз показуємо 1 - 1 з 1

Application of the method of gradual formation of sets of admissible values for solving combinatorial optimization problems
(2021) Mushyn, M.
This article describes a method of gradual formation of sets of admissible values as an alternative to backtracking and account for changes methods. The mechanism of algorithms that apply these methods to solve combinatorial optimization problems is substantiated. Fragments of programs that implement these algorithms in C# programming language are given and the results of their testing in a remote computing environment are analyzed. Test results show that the implementation of the method of gradual formation of sets of admissible values cardinally reduces the execution time of programs, indicating its effectiveness.