Выходит 12 номеров в год
ISSN Печать: 1064-2315
ISSN Онлайн: 2163-9337
Indexed in
Modern Approaches to Solving Complex Discrete Optimization Problems
Краткое описание
The approaches to solving complex discrete optimization problems in sequential and parallel modes are considered. They are based on the use of ideas of the global equilibrium search method and specific features of problems under consideration. Parallelization of problem solving process is carried out using the proposed methodology of constructing the union (portfolios and teams) of algorithms. The results of numerous computational experiments carried out on PC and SKIT-4 supercomputer of ICyb NASU confirm the effectiveness of the developed approaches.
-
Yakovlev S. V., Pichugina O. S., Properties of Combinatorial Optimization Problems Over Polyhedral-Spherical Sets, Cybernetics and Systems Analysis, 54, 1, 2018. Crossref
-
Nagirna Alla M., Quadratic Problem on Combinations Set and Method of Its Solution, Control Systems and Computers, 6 (284), 2019. Crossref
-
Pichugina Oksana, Yakovlev Sergiy, Quadratic Optimization Models and Convex Extensions on Permutation Matrix Set, in Advances in Intelligent Systems and Computing IV, 1080, 2020. Crossref
-
Stoyan Y. G., Yakovlev S. V., Theory and Methods of Euclidian Combinatorial Optimization: Current Status and Prospects, Cybernetics and Systems Analysis, 56, 3, 2020. Crossref
-
Koliechkina Liudmyla M., Dvirna Olena A., Nahirna Alla M., Construction of a Mathematical Model of Multiobjective Optimization on Permutations, Control Systems and Computers, 2 (286), 2020. Crossref
-
Koliechkina L. N., Dvirna O. A., Khovben S. V., A Two-Step Method for Solving Vector Optimization Problems on Permutation Configuration, Cybernetics and Systems Analysis, 57, 3, 2021. Crossref