Combinatorial optimization algorithms combining greedy strategies with a limited search procedure
- Авторы: Kostenko V.1
-
Учреждения:
- Moscow State University
- Выпуск: Том 56, № 2 (2017)
- Страницы: 218-226
- Раздел: Discrete Systems
- URL: https://journals.rcsi.science/1064-2307/article/view/219835
- DOI: https://doi.org/10.1134/S1064230717020137
- ID: 219835
Цитировать
Аннотация
The proposed algorithms basically follow a greedy strategy, and a limited search procedure is invoked only at the steps at which the greedy choice cannot lead to the optimal solution. The principle of these algorithms design are illustrated using the problem of finding the maximum number of compatible jobs as an example. The results of applying the proposed algorithms for scheduling computations in distributed systems are described.
Об авторах
V. Kostenko
Moscow State University
Автор, ответственный за переписку.
Email: kostmsu@gmail.com
Россия, Moscow
![](/img/style/loading.gif)