Alekseev O G

Publications in Math-Net.Ru

1. Qualimetric methods of the estimation of quality
   
   Avtomat. i Telemekh., 1993, no. 1,  3–26
2. 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
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. Some algorithms for solving the covering problem, and their experimental study on a computer
   
   Zh. Vychisl. Mat. Mat. Fiz., 24:10 (1984),  1565–1570
9. A dynamic standardization problem
   
   Zh. Vychisl. Mat. Mat. Fiz., 22:3 (1982),  599–610
10. A minimах problem in scheduling theory
    
    Avtomat. i Telemekh., 1978, no. 1,  108–111
11. Optimization of the sequence of parameter monitoring with the checking time constrained
    
    Avtomat. i Telemekh., 1977, no. 6,  199–203
12. A class of integer programming problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 17:4 (1977),  1047–1052
13. Choosing an optimal set of meters
    
    Avtomat. i Telemekh., 1976, no. 12,  161–163
14. On combined application of dynamic programming and the branch-and-bound method in integer programming problems
    
    Avtomat. i Telemekh., 1976, no. 4,  92–100
15. The algorithm for determining the shortest path in a network graph
    
    Zh. Vychisl. Mat. Mat. Fiz., 11:4 (1971),  1078–1086
16. The utilization of supplementation in solving integer programming problems
    
    Zh. Vychisl. Mat. Mat. Fiz., 10:5 (1970),  1318–1326