|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
1. |
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 |
|
1991 |
2. |
A. O. Alekseev, “The minimax problem of $M$-travelling salesmen”, Zh. Vychisl. Mat. Mat. Fiz., 31:12 (1991), 1899–1905 ; U.S.S.R. Comput. Math. Math. Phys., 31:12 (1991), 101–106 |
2
|
|
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
|
8. |
A. O. Alekseev, “A multivariant travelling-salesman problem”, Zh. Vychisl. Mat. Mat. Fiz., 25:4 (1985), 631–633 ; U.S.S.R. Comput. Math. Math. Phys., 25:2 (1985), 200–201 |
1
|
|
|
|