|
|
|
Publications in Math-Net.Ru |
Citations |
|
2023 |
| 1. |
E. D. Neznakhina, Yu. Yu. Ogorodnikov, K. V. Ryzhenko, M. Yu. Khachay, “Approximation algorithms with constant factors for a series of asymmetric routing problems”, Dokl. RAN. Math. Inf. Proc. Upr., 514:1 (2023), 89–97   ; Dokl. Math., 108:3 (2023), 499–505 |
|
2021 |
| 2. |
Yu. Yu. Ogorodnikov, M. Yu. Khachay, “Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension”, Zh. Vychisl. Mat. Mat. Fiz., 61:7 (2021), 1206–1219 ; Comput. Math. Math. Phys., 61:7 (2021), 1194–1206   |
1
|
|
2020 |
| 3. |
M. Yu. Khachay, Yu. Yu. Ogorodnikov, “Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension”, Dokl. RAN. Math. Inf. Proc. Upr., 493 (2020), 74–80  ; Dokl. Math., 102:1 (2020), 324–329 |
5
|
|
2019 |
| 4. |
M. Yu. Khachay, Yu. Yu. Ogorodnikov, “Haimovich-Rinnooy Kan polynomial-time approximation scheme for the CVRP in metric spaces of a fixed doubling dimension”, Trudy Inst. Mat. i Mekh. UrO RAN, 25:4 (2019), 235–248 |
4
|
|
2018 |
| 5. |
M. Yu. Khachay, Yu. Yu. Ogorodnikov, “Polynomial time approximation scheme for the capacitated vehicle routing problem with time windows”, Trudy Inst. Mat. i Mekh. UrO RAN, 24:3 (2018), 233–246 ; Proc. Steklov Inst. Math. (Suppl.), 307, suppl. 1 (2019), S51–S63 |
9
|
|
2014 |
| 6. |
Yu. Yu. Ogorodnikov, R. T. Faizullin, “Recognition of zero bits of 3-sat problem by applying linear algebra’s methods”, Computer Optics, 38:3 (2014), 521–528 |
|
2013 |
| 7. |
R. T. Faizullin, V. I. Dul'keit, Yu. Yu. Ogorodnikov, “Hybrid method for the approximate solution of the $3$-satisfiability problem associated with the factorization problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 19:2 (2013), 285–294  |
8
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: