Ivan V. Sergienko
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Ivan V. Sergienko has a total of 205 co-authors. Here are the top co-authors by number of shared publications:
- Anatoliy M. Gupal
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
31 shared publications Vasiliy S. Deineka
National Academy of Sciences of Ukraine
29 shared publicationsV. A. Roshchin
National Academy of Sciences of Ukraine
18 shared publications- E. F. Galbaa
V. M. Glushkov Institute of Cybernetics, National Academy of Sciences of Ukraine, Kyiv, Ukraine
17 shared publications V. S. Deineka
Ukrainian National Academy of Sciences
14 shared publications- V. S. Deineka
National Academy of Sciences of Ukraine
14 shared publications
Latest Publications
- 31 July 2026
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 62 (4) , 578-587
Applying Algorithm Unions to Specific Classes of Boolean Programming Problems
- 31 July 2026
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 62 (4) , 578-587
Applying Algorithm Unions to Specific Classes of Boolean Programming Problems
- 1 January 2026
- Published by V.M. Glushkov Institute of Cybernetics in Kibernetyka ta Systemnyi Analiz
- p. 43-54
APPLYING ALGORITHM UNIONS TO SPECIFIC CLASSES OF BOOLEAN PROGRAMMING PROBLEMS
This paper investigates algorithm unions (portfolios and teams) for solving a number of complex Boolean programming problems. Considerable attention is given to the experimental studies of the developed algorithm unions. In particular, for the challenging quadratic assignment problem tai100a — which remains a serious benchmark for researchers worldwide — a new record solution was found using a portfolio of 16 algorithms based on modifications of the tabu search algorithm. Using teams of 4 algorithms made it possible to further improve this record. The speedup factors obtained for solving the set covering problem using portfolios of random iterated local search algorithms, compared to a single algorithm, approach the linear speedup factor. Keywords: algorithm unions (portfolios and teams), Boolean programming problems, experimental studies.
- 1 January 2026
- Published by V.M. Glushkov Institute of Cybernetics in Kibernetyka ta Systemnyi Analiz
- p. 43-54
APPLYING ALGORITHM UNIONS TO SPECIFIC CLASSES OF BOOLEAN PROGRAMMING PROBLEMS
This paper investigates algorithm unions (portfolios and teams) for solving a number of complex Boolean programming problems. Considerable attention is given to the experimental studies of the developed algorithm unions. In particular, for the challenging quadratic assignment problem tai100a — which remains a serious benchmark for researchers worldwide — a new record solution was found using a portfolio of 16 algorithms based on modifications of the tabu search algorithm. Using teams of 4 algorithms made it possible to further improve this record. The speedup factors obtained for solving the set covering problem using portfolios of random iterated local search algorithms, compared to a single algorithm, approach the linear speedup factor. Keywords: algorithm unions (portfolios and teams), Boolean programming problems, experimental studies.
- 30 September 2024
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 60 (5) , 736-752
Algorithmization and Optimization Models of Patient-Centric Rehabilitation Programs*
- 30 September 2024
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 60 (5) , 736-752
Algorithmization and Optimization Models of Patient-Centric Rehabilitation Programs*
- Open Access
- 24 September 2024
- Published by V.M. Glushkov Institute of Cybernetics in Cybernetics and Computer Technologies
- No. 3,p. 25-33
Algorithm Portfolios for Solving the Quadratic Assignment Problem
Introduction. The quadratic assignment problem is a well-established NP-hard problem in combinatorial optimization with applications in diverse fields like economics, archaeology, and chemistry. Due to its complexity, research on efficient solution methods remains active, including efforts for parallelization on multiprocessor computing systems. However, effective parallel algorithms are crucial to fully leverage these computational resources. In this context, algorithm unions (portfolios and teams) play a significant role in achieving parallel execution for solving such problems. Research objectives. This work investigates the application of portfolios constructed from modifications of the repeated iterated tabu search algorithm to the quadratic assignment problem. The effectiveness of these portfolios was evaluated through experimental computations. Results. The portfolios, derived from modifications of the repeated iterated tabu search algorithm, were applied to the quadratic assignment problem. For the most demanding test instances, the proposed algorithms were evaluated on the SCIT-4 supercomputer, alongside previously published results from the authors, confirming their competitive performance. Additionally, we assessed the parallel efficiency of these portfolios in solving instances of the quadratic assignment problem. The results demonstrate their ability to accelerate the optimization process (with speedup dependent on problem size and utilized processors), enabling the solution of large-scale problems. Conclusions. The conducted studies demonstrate that employing algorithm portfolios significantly accelerates the solution process for the quadratic assignment problem. Analysis of the results reveals a near-linear speedup factor achieved by the portfolio. For the challenging test instance tai100a, a new best solution value of 21040996 was obtained using a portfolio of 16 algorithms. Keywords: quadratic assignment problem, algorithm portfolios, experimental research, algorithm portfolios efficiency.
- 24 September 2024
- Published by V.M. Glushkov Institute of Cybernetics in Cybernetics and Computer Technologies
- No. 3,p. 25-33
Open AccessAlgorithm Portfolios for Solving the Quadratic Assignment Problem
Introduction. The quadratic assignment problem is a well-established NP-hard problem in combinatorial optimization with applications in diverse fields like economics, archaeology, and chemistry. Due to its complexity, research on efficient solution methods remains active, including efforts for parallelization on multiprocessor computing systems. However, effective parallel algorithms are crucial to fully leverage these computational resources. In this context, algorithm unions (portfolios and teams) play a significant role in achieving parallel execution for solving such problems. Research objectives. This work investigates the application of portfolios constructed from modifications of the repeated iterated tabu search algorithm to the quadratic assignment problem. The effectiveness of these portfolios was evaluated through experimental computations. Results. The portfolios, derived from modifications of the repeated iterated tabu search algorithm, were applied to the quadratic assignment problem. For the most demanding test instances, the proposed algorithms were evaluated on the SCIT-4 supercomputer, alongside previously published results from the authors, confirming their competitive performance. Additionally, we assessed the parallel efficiency of these portfolios in solving instances of the quadratic assignment problem. The results demonstrate their ability to accelerate the optimization process (with speedup dependent on problem size and utilized processors), enabling the solution of large-scale problems. Conclusions. The conducted studies demonstrate that employing algorithm portfolios significantly accelerates the solution process for the quadratic assignment problem. Analysis of the results reveals a near-linear speedup factor achieved by the portfolio. For the challenging test instance tai100a, a new best solution value of 21040996 was obtained using a portfolio of 16 algorithms. Keywords: quadratic assignment problem, algorithm portfolios, experimental research, algorithm portfolios efficiency.
- 1 January 2024
- Published by V.M. Glushkov Institute of Cybernetics
Cloud-based Platform for Patient-centered Telerehabilitation of Oncology Patients with Mathematical Related Modeling
Physical and medical rehabilitation in Ukraine has been experiencing a period of intensive development in recent years. The focus of the monograph is on one of the most urgent medical challenges globally – the rising incidence and mortality rates of oncological diseases, which rank second only to heart diseases both in Ukraine and worldwide. Breast cancer remains the most prevalent malignancy, thus the work places a special emphasis on it. Information and communication technologies have significantly contributed to the development of the field of rehabilitation medicine, particularly its telerehabilitation sector. A distinctive feature of the proposed information technology and the corresponding system architecture is the integration of artificial intelligence methods with precise mathematical optimization techniques for methodologies and the entire telerehabilitation process. The book is intended for specialists in the field of applied intelligent technologies in medicine, as well as professionals in healthcare and rehabilitation, including tele- and psychological rehabilitation.
- 1 January 2024
- Published by V.M. Glushkov Institute of Cybernetics
Cloud-based Platform for Patient-centered Telerehabilitation of Oncology Patients with Mathematical Related Modeling
Physical and medical rehabilitation in Ukraine has been experiencing a period of intensive development in recent years. The focus of the monograph is on one of the most urgent medical challenges globally – the rising incidence and mortality rates of oncological diseases, which rank second only to heart diseases both in Ukraine and worldwide. Breast cancer remains the most prevalent malignancy, thus the work places a special emphasis on it. Information and communication technologies have significantly contributed to the development of the field of rehabilitation medicine, particularly its telerehabilitation sector. A distinctive feature of the proposed information technology and the corresponding system architecture is the integration of artificial intelligence methods with precise mathematical optimization techniques for methodologies and the entire telerehabilitation process. The book is intended for specialists in the field of applied intelligent technologies in medicine, as well as professionals in healthcare and rehabilitation, including tele- and psychological rehabilitation.
- 1 September 2023
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 59 (5) , 733-742
Planning of Logistics Missions of the “UAV+Vehicle” Hybrid Systems
- 1 September 2023
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 59 (5) , 733-742
Planning of Logistics Missions of the “UAV+Vehicle” Hybrid Systems
- Open Access
- 28 July 2023
- Published by V.M. Glushkov Institute of Cybernetics in Cybernetics and Computer Technologies
- No. 2,p. 11-22
Application of the Global Equilibrium Search Method for Solving Boolean Programming Problems
Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives the advancement of techniques capable of solving complex real-world problems. This paper introduces the Global Equilibrium Search (GES) method as a highly effective approach for solving Boolean programming problems, thus contributing to the field's progress and applicability. Purpose. We describe the successful application of the approximate probabilistic GES method for effectively solving various Boolean programming problems. Results. This paper explores the application of sequential GES algorithms for solving Boolean linear, Boolean quadratic programming, and other related problems with their specific characteristics. In our study, we conducted a comparative analysis to assess the effectiveness of GES algorithms by evaluating them against state-of-the-art approaches. Additionally, to parallelize the optimization process for discrete programming problems, we introduced algorithm unions, specifically portfolios, and teams. The efficiency of GES algorithm portfolios and teams is investigated by solving the maximum weighted graph cut problem, with subsequent comparisons to identify distinctions between them. Conclusions. Based on the accumulated experience of applying GES algorithms and their modifications to solve discrete optimization problems, this study establishes the GES method as the leading approximate approach for Boolean programming. The results demonstrate the GES algorithm unions experience a significant boost in the optimization process speed, whereas algorithm teams demonstrate higher efficiency.
- 28 July 2023
- Published by V.M. Glushkov Institute of Cybernetics in Cybernetics and Computer Technologies
- No. 2,p. 11-22
Open AccessApplication of the Global Equilibrium Search Method for Solving Boolean Programming Problems
Introduction. The significance of methods and algorithms for solving discrete optimization problems in mathematical supporting computer technologies of diverse levels and objectives is increasing. Consequently, the efficacy of discrete optimization methods deserves particular attention, as it drives the advancement of techniques capable of solving complex real-world problems. This paper introduces the Global Equilibrium Search (GES) method as a highly effective approach for solving Boolean programming problems, thus contributing to the field's progress and applicability. Purpose. We describe the successful application of the approximate probabilistic GES method for effectively solving various Boolean programming problems. Results. This paper explores the application of sequential GES algorithms for solving Boolean linear, Boolean quadratic programming, and other related problems with their specific characteristics. In our study, we conducted a comparative analysis to assess the effectiveness of GES algorithms by evaluating them against state-of-the-art approaches. Additionally, to parallelize the optimization process for discrete programming problems, we introduced algorithm unions, specifically portfolios, and teams. The efficiency of GES algorithm portfolios and teams is investigated by solving the maximum weighted graph cut problem, with subsequent comparisons to identify distinctions between them. Conclusions. Based on the accumulated experience of applying GES algorithms and their modifications to solve discrete optimization problems, this study establishes the GES method as the leading approximate approach for Boolean programming. The results demonstrate the GES algorithm unions experience a significant boost in the optimization process speed, whereas algorithm teams demonstrate higher efficiency.
- Open Access
- 21 December 2022
- Published by National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka) (Publications) in Reports of the National Academy of Sciences of Ukraine
- No. 6,p. 17-27
Зважені псевдообернені матриці з індефінітними виродженими вагами
Досліджено зважені псевдообернені матриці з виродженими знаконевизначеними вагами. Визначено необхідні й достатні умови існування та єдиності цих матриць. Наведено означення зважених псевдообернених матриць з індефінітними виродженими вагами в термінах коефіцієнтів характеристичних многочленів матриць, що симетризуються. Отримано розвинення зважених псевдообернених матриць із змішаними вагами в матричні степеневі ряди і добутки, граничні зображення цих матриць.
- 21 December 2022
- Published by National Academy of Sciences of Ukraine (Co. LTD Ukrinformnauka) (Publications) in Reports of the National Academy of Sciences of Ukraine
- No. 6,p. 17-27
Open AccessЗважені псевдообернені матриці з індефінітними виродженими вагами
Досліджено зважені псевдообернені матриці з виродженими знаконевизначеними вагами. Визначено необхідні й достатні умови існування та єдиності цих матриць. Наведено означення зважених псевдообернених матриць з індефінітними виродженими вагами в термінах коефіцієнтів характеристичних многочленів матриць, що симетризуються. Отримано розвинення зважених псевдообернених матриць із змішаними вагами в матричні степеневі ряди і добутки, граничні зображення цих матриць.
- 24 July 2021
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 57 (4) , 521-529
Optimization of Parameters in the Generalized D’alembert Formula for a Function of Two Variables
- 24 July 2021
- Published by Springer Nature in Cybernetics and Systems Analysis
- Vol. 57 (4) , 521-529
Optimization of Parameters in the Generalized D’alembert Formula for a Function of Two Variables