Departments

Cooperation and services

• Mathematical models and methods of operation research and optimization of production, transport and warehouse logistics.
• Development of algorithms for analyzing genome and proteomic data, modeling of biological systems.
• Development of methods of computer modeling and generation of new drug compounds based on artificial intelligence technologies.

Results of scientific research and development

• Destroyed the theory of parametric decomposition of extreme problems. Subsequently, employees of laboratories of mathematical cybernetics and operations research developed the theory of an expanded parametric decomposition.
• The concept of priority-generating functionality has been introduced and a common approach to the optimization of such functions on a set of permutations of partially ordered elements with a given division of elements into groups has been developed. It is shown that in a number of tasks of building optimal schedules, the target function is a priority-generating.
• The complexity of the tasks of the theory of schedules in a fixed number of requirements and devices is investigated. Proven NP-difficulty task of optimal maintenance by three devices. The results of NP-difficacy are true for any regular optimum criterion, both in the case of the same requirements service routes and in the case of different routes. Polynomial algorithms for optimal maintenance of two requirements with an unlimited number of service stages with an arbitrary regular optimum criterion (both with permission to interrupt operations and no interruptions) have been developed.
• Polynomial algorithms for solving the problems of building schedules with the purpose of directive timing, depending on the duration of requirements maintenance, are developed. Approaches to tasks in which individual policy time is tough and the rest provides for a fine for violation of the policy time.
• General approaches to building Ɛ-approximate algorithms for optimization problems have been developed. Polynomial Ɛ-approximate algorithms for solving numerous problems of discrete optimization and the theory of schedules have been developed. A method for improving the estimates of the optimal value of the target function for representative classes of optimization tasks is proposed.

Among the most significant results obtained after 2005, it is possible to note:

• General schemes of construction of effective approximate algorithms for solving optimization problems, theory of building schemes for servicing batches, methods of solving problems of industrial and transport logistics, general approaches to establishing computational complexity of problems, algorithms for determining the linear structure of DNA molecules, models and algorithms for building schedules for multiprocessor computing systems, dynamic price management in the hotel business, optimization of purchases on the Internet, building optimal routes and navigationBuses.
• A stable method of solving vague (interval) problems of the theory of schedules and balancing assembly lines; network methods of constructing optimal schedules for multi-stage service systems, including both identical machines capable of processing the same set of operations, and different machines capable of processing different types of operations; based on the models of the problems of the theory of schedules in the form of mixed graphs and multigraphs; classes of problems of the theory of schedules.the vertices of mixed graphs that determine the initial data of the corresponding tasks of the theory of schedules.
• Effective algorithms for segmentation and analysis of three-dimensional images based on deformable models, processing and visualization of tomographic images to support the planning of orthopedic operations, reconstruction of three-dimensional scenes by several images.
• Algorithms of analysis and prediction of structural changes of proteins in interaction, modeling of three-dimensional structures of dimeric protein complexes with different initial conditions, search for mutations in the genomes of microorganisms statistically related to drug resistance.
• Approaches of computer screening and identification of potential HIV-1 immunodeficiency inhibitors based on high-affinth ligands of the virus, the SARS-CoV-2 coronavirus, tuberculosis mycobacterium, etc., deep learning and molecular modeling algorithms for the design of potential candidates for drugs for various molecular targets.

Industrial and social projects have been implemented: algorithms and software of a flexible production site (Ukraine), planning of the workshop of small-scale production (Russia), models, methods, algorithms and software control of the medical hyperthermia procedure for the Institute of Oncology and Medical Radiology (Belarus), planning of the workforce of the production line (France), route delivery of oil products (Russia), multi-criteria routing and navigation of pedestrians.writing of the finishing factory (Belarus), methods and software for assessing and improving the safety of artillery munitions (Belarus), methods and software for solving optimization problems in the process of clearing interbank payments (Belarus), building a timetable of parallel devices with dynamically changing estimates of requirements parameters (USA).

Multilateral and bilateral research and educational projects with the financial support of INTAS, IITC, TEMPUS, PICS, FP6, FP7, ERA-NET, ANSO, Armenia, Germany, China, Luxembourg, Norway, Poland, Russia, France were carried out.

Achievements

Prize of the Lenin Komsomol of Belarus for the cycle of works “Combinatorial algorithms for solving problems of optimal planning and design”.
• State Prize of the Republic of Belarus in the field of natural sciences for the cycle of works "Models and methods of the theory of schedules".
• Prize of the NAS of Belarus for the monograph “Theory of Schedules. Group technologies.
• State Prize of the Republic of Belarus in the field of natural sciences for the study cycle “Discreation and analysis of stochastic data and digital images”.
• Fourth place in the list of the most cited scientists in Belarus (M.Y. Kovalev).
• Winner of the 2015 "TOP-10" competition of the results of the activities of scientists of the National Academy of Sciences of Belarus in the field of fundamental and applied research for the detection of computer screening and modeling of new low molecular weight chemical compounds with aromatic fragments, forming promising basic structures for the creation of effective drugs against HIV/AIDS with a wide range of neutralizing action.
• Prize of the National Academy of Sciences of Belarus “Computer design of potential HIV-1 inhibitors, promising for the creation of antiviral drugs of the new generation”.
• Winner of the 2020 "TOP-10" competition of the results of the activities of scientists of the National Academy of Sciences of Belarus in the field of fundamental and applied research for identification by methods of computer screening and molecular modeling of potential inhibitors of the SARS-CoV-2 coronavirus.
• Interstate Award "Stars of the Commonwealth" in the field of science and education.