Zobrazeno 1 - 10
of 42
pro vyhledávání: '"Kovalenko Yulia"'
Publikováno v:
E3S Web of Conferences, Vol 460, p 03019 (2023)
The improvement in the disclosure of financial and non-financial information in most cases is provoked by the desire of the international professional community to develop fundamentally new scientifically sound, but at the same time aimed at applying
Externí odkaz:
https://doaj.org/article/e80fe2dbfc574d14a922051e8e94b4c1
Autor:
Eremeev Anton V., Kovalenko Yulia V.
Publikováno v:
Yugoslav Journal of Operations Research, Vol 27, Iss 4, Pp 415-426 (2017)
We consider the Travelling Salesman Problem with Vertex Requisitions where, for each position of the tour, at most two possible vertices are given. It is known that the problem is strongly NP-hard. The algorithm, we propose for this problem, has less
Externí odkaz:
https://doaj.org/article/ffe43536c448421aaf2721bc01092afe
Autor:
Kononov, Alexander, Kovalenko, Yulia
Publikováno v:
Mathematical Optimization Theory and Operations Research. MOTOR 2021. Lecture Notes in Computer Science, vol 12755, pp. 267-279
We consider the problem of scheduling multiprocessor jobs to minimize the total completion time under the given energy budget. Each multiprocessor job requires more than one processor at the same moment of time. Processors may operate at variable spe
Externí odkaz:
http://arxiv.org/abs/2107.10142
Autor:
Kononov, Alexander, Kovalenko, Yulia
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume and the required number of processors. We propose new constant factor
Externí odkaz:
http://arxiv.org/abs/1811.11595
We consider the bicriteria asymmetric travelling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wide in real-world problems. For the first time we apply to the bi-ATSP
Externí odkaz:
http://arxiv.org/abs/1812.00768
We consider the bicriteria asymmetric traveling salesman problem (bi-ATSP). Optimal solution to a multicriteria problem is usually supposed to be the Pareto set, which is rather wide in real-world problems. We apply to the bi-ATSP the axiomatic appro
Externí odkaz:
http://arxiv.org/abs/1805.10606
Autor:
Eremeev, Anton, Kovalenko, Yulia
We consider the Travelling Salesman Problem with Vertex Requisitions, where for each position of the tour at most two possible vertices are given. It is known that the problem is strongly NP-hard. The proposed algorithm for this problem has less time
Externí odkaz:
http://arxiv.org/abs/1703.03963
Publikováno v:
AIP Conference Proceedings; 2024, Vol. 3021 Issue 1, p1-4, 4p
Publikováno v:
AIP Conference Proceedings; 2024, Vol. 3102 Issue 1, p1-4, 4p
Autor:
Balakireva, Elena A., Kovalenko, Yulia V., Begina, Oksana G., Tempelin, Evgenia A., Kryuchkova, Tatiana A.
Publikováno v:
Iranian Rehabilitation Journal; Mar2023, Vol. 21 Issue 1, p89-96, 8p