|
|
|
Publications in Math-Net.Ru |
Citations |
|
2016 |
| 1. |
A. V. Panyukov, R. E. Shangin, “Algorithm for the discrete Weber's problem with an accuracy estimate”, Avtomat. i Telemekh., 2016, no. 7, 103–112   ; Autom. Remote Control, 77:7 (2016), 1208–1215   |
3
|
|
2014 |
| 2. |
A. V. Panyukov, R. E. Shangin, “An exact algorithm for solving the discrete Weber problem for a $k$-tree”, Diskretn. Anal. Issled. Oper., 21:3 (2014), 64–75  |
3
|
| 3. |
R. E. Shangin, “Heuristics for design of reliable telecommunication network”, Prikl. Diskr. Mat. Suppl., 2014, no. 7, 164–165 |
| 4. |
R. E. Shangin, “Exact and Heuristic Algorithms for Solving Discrete Weber Problem for a Simple Cycle”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:2 (2014), 98–107 |
|
2013 |
| 5. |
R. E. Shangin, “A deterministic algorithm for solving the Weber problem for an $n$-sequentially connected chain”, Diskretn. Anal. Issled. Oper., 20:5 (2013), 84–96 |
3
|
| 6. |
R. E. Shangin, “Exact algorithm for solving discrete Weber problem for a cycle”, Prikl. Diskr. Mat., 2013, no. 4(22), 96–102 |
1
|
| 7. |
R. E. Shangin, “Exact algorithm for solving special case of discrete Weber problem”, Prikl. Diskr. Mat. Suppl., 2013, no. 6, 136–137 |
| 8. |
R. E. Shangin, “Constructive descriptions of $n$-sequentially connected graphs”, Vladikavkaz. Mat. Zh., 15:4 (2013), 48–57 |
|
| Organisations |
|
| |
|
|
Contact us: