|
|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
| 1. |
O. G. Alekseev, B. V. Podsevalov, U. I. Reinov, “Qualimetric methods of the estimation of quality”, Avtomat. i Telemekh., 1993, no. 1, 3–26  |
| 2. |
A. O. Alekseev, O. G. Alekseev, O. A. Kulagin, “Experimental estimate of the efficiency of an algorithm for solving the minimax travelling salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 33:3 (1993), 476–478   ; Comput. Math. Math. Phys., 33:3 (1993), 441–442  |
|
1990 |
| 3. |
A. O. Alekseev, O. G. Alekseev, V. D. Kiselev, “Application of the resolving multipliers of the modified simplex method in problems of integer linear programming”, Zh. Vychisl. Mat. Mat. Fiz., 30:11 (1990), 1753–1755 ; U.S.S.R. Comput. Math. Math. Phys., 30:6 (1990), 114–115 |
1
|
| 4. |
A. O. Alekseev, O. G. Alekseev, V. D. Kiselev, “The use of duality to determine the branching order of variables and to estimate the bounds in the solution of the knapsack problem”, Zh. Vychisl. Mat. Mat. Fiz., 30:4 (1990), 630–631 ; U.S.S.R. Comput. Math. Math. Phys., 30:2 (1990), 199–200 |
2
|
|
1989 |
| 5. |
A. O. Alekseev, O. G. Alekseev, S. A. Vasil'kovskii, “A generalized siting problem”, Avtomat. i Telemekh., 1989, no. 5, 112–119 ; Autom. Remote Control, 50:5 (1989), 666–672 |
1
|
|
1988 |
| 6. |
A. O. Alekseev, O. G. Alekseev, V. D. Kiselev, G. P. Mirovitskii, “An experimental estimate of the effectiveness of using duality to solve discrete programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 28:12 (1988), 1904–1905 ; U.S.S.R. Comput. Math. Math. Phys., 28:6 (1988), 208–210 |
|
1985 |
| 7. |
A. O. Alekseev, O. G. Alekseev, V. G. Anisimov, E. G. Anisimov, “The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem”, Zh. Vychisl. Mat. Mat. Fiz., 25:11 (1985), 1666–1673 ; U.S.S.R. Comput. Math. Math. Phys., 25:6 (1985), 50–54 |
11
|
|
1984 |
| 8. |
O. G. Alekseev, V. F. Grigor'ev, “Some algorithms for solving the covering problem, and their experimental study on a computer”, Zh. Vychisl. Mat. Mat. Fiz., 24:10 (1984), 1565–1570 ; U.S.S.R. Comput. Math. Math. Phys., 24:5 (1984), 175–179 |
2
|
|
1982 |
| 9. |
O. G. Alekseev, V. A. Kezhaev, “A dynamic standardization problem”, Zh. Vychisl. Mat. Mat. Fiz., 22:3 (1982), 599–610 ; U.S.S.R. Comput. Math. Math. Phys., 22:3 (1982), 108–118 |
1
|
|
1978 |
| 10. |
O. G. Alekseev, “A minimàõ problem in scheduling theory”, Avtomat. i Telemekh., 1978, no. 1, 108–111 ; Autom. Remote Control, 39:1 (1978), 87–89 |
|
1977 |
| 11. |
O. G. Alekseev, S. M. Alekseeva, “Optimization of the sequence of parameter monitoring with the checking time constrained”, Avtomat. i Telemekh., 1977, no. 6, 199–203 ; Autom. Remote Control, 38:6 (1977), 940–945 |
| 12. |
O. G. Alekseev, “A class of integer programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 17:4 (1977), 1047–1052 ; U.S.S.R. Comput. Math. Math. Phys., 17:4 (1977), 222–228 |
|
1976 |
| 13. |
O. G. Alekseev, “Choosing an optimal set of meters”, Avtomat. i Telemekh., 1976, no. 12, 161–163 |
| 14. |
O. G. Alekseev, I. F. Volodos', “On combined application of dynamic programming and the branch-and-bound method in integer programming problems”, Avtomat. i Telemekh., 1976, no. 4, 92–100 ; Autom. Remote Control, 37:4 (1976), 557–565 |
|
1971 |
| 15. |
S. M. Alekseeva, O. G. Alekseev, “The algorithm for determining the shortest path in a network graph”, Zh. Vychisl. Mat. Mat. Fiz., 11:4 (1971), 1078–1086 ; U.S.S.R. Comput. Math. Math. Phys., 11:4 (1971), 336–345 |
1
|
|
1970 |
| 16. |
O. G. Alekseev, V. N. Kolesnikov, “The utilization of supplementation in solving integer programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 10:5 (1970), 1318–1326 ; U.S.S.R. Comput. Math. Math. Phys., 10:5 (1970), 324–334 |
|
| Organisations |
|
| |
|
|
Contact us: