|
|
Publications in Math-Net.Ru
-
On the asymptotic accuracy of an algorithm for solving the $m$-PSP maximum problem in a multidimensional Euclidean space
Trudy Inst. Mat. i Mekh. UrO RAN, 16:3 (2010), 12–24
-
The problem of finding a subset of vectors with the maximum total weight
Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 32–42
-
Certain generalization of the maximum traveling salesman problem
Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006), 3–12
-
A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight
Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006), 11–20
-
An approximate algorithm for finding a maximum-weight $d$-homogeneous connected spanning subgraph in a complete graph with random edge weights
Diskretn. Anal. Issled. Oper., Ser. 2, 13:2 (2006), 3–20
-
Polynomial algorithms for solving the vector sum problem
Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006), 3–10
-
Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight
Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004), 11–25
-
On the asymptotic accuracy of an algorithm for solving the traveling salesman problem for a maximum in a Euclidean space
Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002), 23–32
© , 2024