|
|
|
Publications in Math-Net.Ru |
Citations |
|
2022 |
| 1. |
A. A. Ageev, E. Kh. Gimadi, O. Yu. Tsidulko, A. A. Shtepa, “Capacitated Facility Location Problem on tree-like graphs”, Trudy Inst. Mat. i Mekh. UrO RAN, 28:2 (2022), 24–44    |
|
2014 |
| 2. |
A. A. Ageev, A. V. Kel'manov, A. V. Pyatkin, “Complexity of the Euclidean max cut problem”, Diskretn. Anal. Issled. Oper., 21:4 (2014), 3–11 ; J. Appl. Industr. Math., 8:4 (2014), 453–457 |
5
|
|
2009 |
| 3. |
A. A. Ageev, E. Kh. Gimadi, A. A. Kurochkin, “Polynomial algorithm for the path facility location problem with uniform capacities”, Diskretn. Anal. Issled. Oper., 16:5 (2009), 3–18  |
5
|
| 4. |
A. A. Ageev, A. V. Pyatkin, “A 2-approximation algorithm for the metric 2-peripatetic salesman problem”, Diskretn. Anal. Issled. Oper., 16:4 (2009), 3–20 |
6
|
|
2007 |
| 5. |
A. A. Ageev, “Алгоритм с оценками для пропорционального случая двухпроцессорной задачи теории расписаний типа flow shop c минимальными задержками”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:4 (2007), 3–15 ; J. Appl. Industr. Math., 2:4 (2008), 447–454  |
| 6. |
A. A. Ageev, “Метрические задачи размещения c не кратчайшими маршрутами обслуживания”, Diskretn. Anal. Issled. Oper., Ser. 1, 14:3 (2007), 3–12 ; J. Appl. Industr. Math., 2:3 (2008), 311–316 |
2
|
|
2006 |
| 7. |
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
|
| 8. |
A. A. Ageev, V. P. Il'ev, A. V. Kononov, A. S. Televnin, “Computational complexity of the graph approximation problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:1 (2006), 3–15 ; J. Appl. Industr. Math., 1:1 (2007), 1–8 |
30
|
|
2004 |
| 9. |
A. A. Ageev, “Algorithms with improved estimates for accuracy for the set covering problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004), 3–10 |
|
1997 |
| 10. |
A. A. Ageev, “Complexity of the determination of the maximum weighted joining in a graph”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:3 (1997), 3–8 |
|
1994 |
| 11. |
A. A. Ageev, “Complexity of the network problem of a median on planar lattices”, Trudy Inst. Mat. SO RAN, 27 (1994), 6–13 |
| 12. |
A. A. Ageev, “Dominating sets and hamiltonicity in $K_{1,3}$-free graphs”, Sibirsk. Mat. Zh., 35:3 (1994), 475–479 ; Siberian Math. J., 35:3 (1994), 421–425  |
2
|
|
1990 |
| 13. |
A. A. Ageev, “A polynomial algorithm for solving the location problem on a series-parallel network”, Upravliaemie systemy, 1990, no. 30, 3–16 |
|
1989 |
| 14. |
A. A. Ageev, “Graphs, matrices and an elementary location problem”, Upravliaemie systemy, 1989, no. 29, 3–10 |
|
1988 |
| 15. |
A. A. Ageev, “A transformation of the problem of maximizing a concave separable function on a polymatroid intersection”, Upravliaemie systemy, 1988, no. 28, 3–7 |
| 16. |
A. A. Ageev, V. L. Beresnev, “Algorithms for the minimization of certain classes of polynomials of Boolean variables”, Trudy Inst. Mat. Sib. Otd. AN SSSR, 10 (1988), 5–17 |
|
1985 |
| 17. |
A. A. Ageev, “Approximate algorithms for the minimization of polynomials in Boolean variables”, Upravliaemie systemy, 1985, no. 26, 3–19 |
|
1984 |
| 18. |
A. A. Ageev, “Minimization of quadratic polynomials of Boolean variables”, Upravliaemie systemy, 1984, no. 25, 3–16 |
|
1983 |
| 19. |
A. A. Ageev, “Complexity of problems of minimization of polynomials in Boolean variables”, Upravliaemie systemy, 1983, no. 23, 3–11 |
|
1981 |
| 20. |
A. A. Ageev, “Minimization of some polynomials from Boolean variables”, Upravliaemie systemy, 1981, no. 21, 3–5 |
|
| Organisations |
|
| |
|
|
Contact us: