|
|
|
Publications in Math-Net.Ru |
Citations |
|
2025 |
| 1. |
I. Ya. Zabotin, O. N. Shul'gina, R. S. Yarullin, “A variant of the successive concessions method and its implementation based on cutting procedures”, Trudy Inst. Mat. i Mekh. UrO RAN, 31:3 (2025), 138–149   |
|
2023 |
| 2. |
I. Ya. Zabotin, K. E. Kazaeva, O. N. Shul'gina, “A cutting-plane method with internal iteration points for the general convex programming problem”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 165:3 (2023), 208–218 |
| 3. |
I. Ya. Zabotin, O. N. Shulgina, R. S. Yarullin, “A relaxed version of the cutting method with approximation of the constraint region”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 165:2 (2023), 143–152 |
|
2016 |
| 4. |
I. Ya. Zabotin, O. N. Shul'gina, R. S. Yarullin, “Minimization method with approximation of constraint zone and epigraph of objective function”, Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 11, 91–96 ; Russian Math. (Iz. VUZ), 60:11 (2016), 78–81   |
9
|
|
2014 |
| 5. |
I. Ya. Zabotin, O. N. Shulgina, R. S. Yarullin, “A cutting method and construction of mixed minimization algorithms on its basis”, Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 156:4 (2014), 14–24 |
2
|
|
2008 |
| 6. |
O. N. Shulgina, N. K. Sherbakova, “Pseudopolynomial Approximation Algorithm for Solving the $NP$-Complete Problem of Minimizing Maximum Lateness”, Kazan. Gos. Univ. Uchen. Zap. Ser. Fiz.-Mat. Nauki, 150:4 (2008), 154–161 |
|
2004 |
| 7. |
O. N. Shul'gina, “A General Scheme for Solving an NP-hard Problem in the Strong Sense of the Scheduling Theory”, Avtomat. i Telemekh., 2004, no. 3, 108–115   ; Autom. Remote Control, 65:3 (2004), 456–463 |
|
| Organisations |
|
|
