|
|
|
Publications in Math-Net.Ru |
Citations |
|
2018 |
| 1. |
E. V. Prosolupov, G. Sh. Tamasyan, “Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function”, Diskretn. Anal. Issled. Oper., 25:2 (2018), 82–100   ; J. Appl. Industr. Math., 12:2 (2018), 325–333  |
1
|
|
2016 |
| 2. |
G. Sh. Tamasyan, E. V. Prosolupov, T. A. Angelov, “Comparative study of two fast algorithms for projecting a point to the standard simplex”, Diskretn. Anal. Issled. Oper., 23:2 (2016), 100–123  ; J. Appl. Industr. Math., 10:2 (2016), 288–301 |
2
|
|
2014 |
| 3. |
E. V. Prosolupov, “On sufficient conditions for equality of the independence number and the clique cover number for a class of graphs”, Vestnik S.-Petersburg Univ. Ser. 10. Prikl. Mat. Inform. Prots. Upr., 2014, no. 1, 90–103 |
|
| Organisations |
|
|
Contact us: