|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
A. A. Ageev, E. Kh. Gimadi, O. Yu. Tsidulko, A. A. Shtepa, “Capacitated Facility Location Problem on tree-like graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022), 24–44    |
|
2020 |
| 2. |
E. Kh. Gimadi, O. Yu. Tsidulko, “On Some Efficiently Solvable Classes of the Network Facility Location Problem with Constraints on the Capacities of Communication Lines”, Trudy Inst. Mat. i Mekh. UrO RAN, 26:2 (2020), 108–124 ; Proc. Steklov Inst. Math. (Suppl.), 313, suppl. 1 (2021), S58–S72   |
|
2017 |
| 3. |
E. Kh. Gimadi, O. Yu. Tsidulko, “An asymptotically optimal algorithm for the $m$-peripatetic salesman problem on random inputs with discrete distribution”, Diskretn. Anal. Issled. Oper., 24:3 (2017), 5–19 ; J. Appl. Industr. Math., 11:3 (2017), 354–361 |
2
|
|
2014 |
| 4. |
E. Kh. Gimadi, Yu. V. Glazkov, O. Yu. Tsidulko, “The probabilistic analysis of an algorithm for solving the $m$-planar $3$-dimensional assignment problem on one-cycle permutations”, Diskretn. Anal. Issled. Oper., 21:1 (2014), 15–29 ; J. Appl. Industr. Math., 8:2 (2014), 208–217 |
7
|
| 5. |
E. Kh. Gimadi, A. M. Istomin, I. A. Rykov, O. Yu. Tsidulko, “Probabilistic analysis of an approximation algorithm for the $m$-peripatetic salesman problem on random instances unbounded from above”, Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014), 88–98 ; Proc. Steklov Inst. Math. (Suppl.), 289, suppl. 1 (2015), 77–87 |
2
|
|
2013 |
| 6. |
O. Yu. Tsidulko, “On solvability of the axial $8$-index assignment problem on one-cycle permutations”, Diskretn. Anal. Issled. Oper., 20:5 (2013), 66–83 ; J. Appl. Industr. Math., 8:1 (2014), 115–126 |
2
|
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
| |
|
|
Contact us: