Alekseev A O

Publications in Math-Net.Ru

1. 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
2. The minimax problem of $M$-travelling salesmen
   
   Zh. Vychisl. Mat. Mat. Fiz., 31:12 (1991),  1899–1905
3. 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
4. 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
5. A generalized siting problem
   
   Avtomat. i Telemekh., 1989, no. 5,  112–119
6. An experimental estimate of the effectiveness of using duality to solve discrete programming problems
   
   Zh. Vychisl. Mat. Mat. Fiz., 28:12 (1988),  1904–1905
7. 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
8. A multivariant travelling-salesman problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 25:4 (1985),  631–633