|
|
Publications in Math-Net.Ru
-
A randomized algorithm for the vector subset problem with the maximal Euclidean norm of its sum
Diskretn. Anal. Issled. Oper., 22:3 (2015), 5–17
-
Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015), 89–99
-
Probabilistic analysis of an approximation algorithm for the $m$-peripatetic salesman problem on random instances unbounded from above
Trudy Inst. Mat. i Mekh. UrO RAN, 20:2 (2014), 88–98
-
On 2-Capacitated Peripatetic Salesman Problem with Different Weight Functions
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 14:3 (2014), 3–18
-
On $m$-capacitated peripatetic salesman problem
Diskretn. Anal. Issled. Oper., 20:5 (2013), 13–30
-
On polynomial solvability of some vector subset problems in Euclidean space with fixed dimension
Diskretn. Anal. Issled. Oper., 15:6 (2008), 11–19
-
On comparison of the strip packing problem with a certain project scheduling problem
Diskretn. Anal. Issled. Oper., 15:4 (2008), 57–73
-
The vector subset problem with integer coordinates in Euclidean space with the maximum sum
Diskretn. Anal. Issled. Oper., 15:4 (2008), 30–43
© , 2025