|
|
Publications in Math-Net.Ru |
Citations |
|
2010 |
1. |
A. E. Baburin, E. Kh. Gimadi, “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 ; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S1–S13 |
22
|
|
2007 |
2. |
A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, A. V. Pyatkin, “The problem of finding a subset of vectors with the maximum total weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 32–42 ; J. Appl. Industr. Math., 2:1 (2008), 32–38 |
28
|
|
2006 |
3. |
A. E. Baburin, E. Kh. Gimadi, “Certain generalization of the maximum traveling salesman problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006), 3–12 ; J. Appl. Industr. Math., 1:4 (2007), 418–423 |
5
|
4. |
A. A. Ageev, A. E. Baburin, E. Kh. Gimadi, “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 ; J. Appl. Industr. Math., 1:2 (2007), 142–147 |
23
|
5. |
A. E. Baburin, E. Kh. Gimadi, “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 ; J. Appl. Industr. Math., 2:2 (2008), 155–166 |
5
|
6. |
A. E. Baburin, A. V. Pyatkin, “Polynomial algorithms for solving the vector sum problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006), 3–10 ; J. Appl. Industr. Math., 1:3 (2007), 268–272 |
18
|
|
2004 |
7. |
A. E. Baburin, E. Kh. Gimadi, N. M. Korkishko, “Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004), 11–25 |
14
|
|
2002 |
8. |
A. E. Baburin, E. Kh. Gimadi, “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 |
1
|
|
Organisations |
|
|
|
|