|
|
|
Публикации в базе данных Math-Net.Ru |
Цитирования |
|
2022 |
| 1. |
G. A. Arutyunov, S. M. Avdoshin, “Big Transformers for Code Generation”, Труды ИСП РАН, 34:4 (2022), 79–88  |
|
2019 |
| 2. |
S. M. Avdoshin, A. V. Lazarenko, N. I. Chichileva, P. A. Naumov, P. G. Klyucharev, “Machine learning use cases in cybersecurity”, Труды ИСП РАН, 31:5 (2019), 191–202 |
1
|
| 3. |
S. M. Avdoshin, E. N. Beresneva, “Local search metaheuristics for Capacitated Vehicle Routing Problem: a comparative study”, Труды ИСП РАН, 31:4 (2019), 121–138 |
4
|
| 4. |
S. M. Avdoshin, E. N. Beresneva, “Constructive heuristics for Capacitated Vehicle Routing Problem: a comparative study”, Труды ИСП РАН, 31:3 (2019), 145–156  |
2
|
|
2018 |
| 5. |
E. Beresneva, S. Avdoshin, “Analysis of mathematical formulations of capacitated vehicle routing problem and methods for their solution”, Труды ИСП РАН, 30:3 (2018), 233–250 |
7
|
| 6. |
M. K. Gordenko, S. M. Avdoshin, “Variants of chinese postman problems and a way of solving through transformation into vehicle routing problems”, Труды ИСП РАН, 30:3 (2018), 221–232 |
3
|
| 7. |
S. M. Avdoshin, A. V. Lazarenko, “Bitcoin users deanonimization methods”, Труды ИСП РАН, 30:1 (2018), 89–102 |
|
2017 |
| 8. |
S. M. Avdoshin, E. N. Beresneva, “The Metric Travelling Salesman Problem: the experiment on Pareto-optimal algorithms”, Труды ИСП РАН, 29:4 (2017), 123–138 |
3
|
| 9. |
M. K. Gordenko, S. M. Avdoshin, “The mixed chinese postman problem”, Труды ИСП РАН, 29:4 (2017), 107–122 |
2
|
|
2016 |
| 10. |
S. M. Avdoshin, A. V. Lazarenko, “Deep web users deanonimization system”, Труды ИСП РАН, 28:3 (2016), 21–34 |
|
1979 |
| 11. |
С. М. Авдошин, В. В. Белов, “Обобщенный метод «волны» для решения экстремальных задач на графах”, Ж. вычисл. матем. и матем. физ., 19:3 (1979), 739–755   ; S. M. Avdoshin, V. V. Belov, “A generalized “wave” method for solving extremal problems on graphs”, U.S.S.R. Comput. Math. Math. Phys., 19:3 (1979), 189–207 |
|
Обратная связь: