|
|
Publications in Math-Net.Ru
-
Discrete facility location in machine learning
Diskretn. Anal. Issled. Oper., 28:4 (2021), 5–60
-
A branch and cut heuristic for a runway scheduling problem
Avtomat. i Telemekh., 2016, no. 11, 131–141
-
A parallel implementation of the subgradient algorithm for maximizing the Lagrangian dual function in the $p$-median problem
Num. Meth. Prog., 14:1 (2013), 9–16
-
On an approach to the robustness in the case of the $p$-median problem
Bulletin of Irkutsk State University. Series Mathematics, 5:4 (2012), 2–15
-
Lagrangian relaxations for the nonlinear $p$-median problem
Bulletin of Irkutsk State University. Series Mathematics, 4:2 (2011), 45–59
-
A branch and bound method for the facility location problem with customer preferences
Diskretn. Anal. Issled. Oper., 16:2 (2009), 21–41
-
New lower bounds for the facility location problem with clients' preferences
Zh. Vychisl. Mat. Mat. Fiz., 49:6 (2009), 1055–1066
-
Метод декомпозиции для задачи о $p$-медиане на несвязном графе
Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 43–58
-
Cluster analysis application to automatic flaw detection
Probl. Upr., 2007, no. 4, 36–42
-
A parallel search of equilibrium points in bimatrix games
Num. Meth. Prog., 8:3 (2007), 233–243
© , 2026