|
|
Publications in Math-Net.Ru
-
Survival rate of model populations depending on the strategy of energy exchange between the organisms
Izv. Saratov Univ. Math. Mech. Inform., 20:2 (2020), 241–256
-
Experimental research of the application of modern combinatorial optimization solvers to the accompanying manufacturing optimization problem
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 29:4 (2019), 599–611
-
Big-data approach in abundance estimation of non-identifiable animals with camera-traps at the spots of attraction
Vestnik YuUrGU. Ser. Mat. Model. Progr., 12:1 (2019), 20–31
-
Experimental research on the welfare in a closed production network
Izv. IMI UdGU, 52 (2018), 33–46
-
Iterative equitable partition of graph as a model of constant structure discrete time closed semantic system
Vestnik YuUrGU. Ser. Mat. Model. Progr., 10:4 (2017), 26–34
-
Two-level optimization of sensors reposition
Vestnik YuUrGU. Ser. Mat. Model. Progr., 9:3 (2016), 130–136
-
Adaptive stability in combinatorial optimization problems
Trudy Inst. Mat. i Mekh. UrO RAN, 20:1 (2014), 100–108
-
Dynamic programming in a problem of rearranging single-type objects
Trudy Inst. Mat. i Mekh. UrO RAN, 19:4 (2013), 125–130
-
Truncated dynamic programming method in a closed traveling salesman problem with symmetric value function
Trudy Inst. Mat. i Mekh. UrO RAN, 19:1 (2013), 121–129
-
A stability criterion for optimal solutions of a minimax problem about a partition into an arbitrary number of subsets under varying cardinality of the initial set
Trudy Inst. Mat. i Mekh. UrO RAN, 18:4 (2012), 180–194
-
Method of scaling in approximate solution of the traveling salesman problem
Avtomat. i Telemekh., 2011, no. 12, 115–129
-
Dynamic programming in a generalized courier problem with inner tasks: elements of a parallel structure
Model. Anal. Inform. Sist., 18:3 (2011), 101–124
-
Sufficient stability conditions in the traveling salesman problem
Trudy Inst. Mat. i Mekh. UrO RAN, 17:3 (2011), 155–168
-
Criterion of the stability of optimal route in the travelling salesman problem in case of a single vertex addition
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2011, no. 1, 58–66
-
Sufficient conditions of the stability of optimal route in the Travelling Salesman Problem in cases of a single vertex addition or substraction
Vestn. Udmurtsk. Univ. Mat. Mekh. Komp. Nauki, 2010, no. 1, 48–57
-
Exact approximation of average subword complexity of finite random words over finite alphabet
Trudy Inst. Mat. i Mekh. UrO RAN, 14:4 (2008), 185–189
-
Dynamic Programming Method in Bottleneck Tasks Distribution Problem with Equal Agents
Vestnik YuUrGU. Ser. Mat. Model. Progr., 6:1 (2013), 124–133
© , 2026