Shul'gina Oksana Nikolaevna

Publications in Math-Net.Ru

1. 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
2. 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. 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
4. Minimization method with approximation of constraint zone and epigraph of objective function
   
   Izv. Vyssh. Uchebn. Zaved. Mat., 2016, no. 11,  91–96
5. 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
6. 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
7. 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