Glebov Nikolai Ivanovich

Publications in Math-Net.Ru

1. The problem of finding a subset of vectors with the maximum total weight
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007),  32–42
2. On a generalization of the minimax assignment problem
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 11:4 (2004),  36–43
3. On conditions for the solvability of optimization problems by a greedy algorithm
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002),  3–12
4. On the description of a class of problems solvable by a coordinate-wise ascent algorithm
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 8:3 (2001),  15–25
5. On the applicability of a coordinate-wise ascent algorithm to integer programming problems
   
   Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000),  38–47
6. On a problem of the choice of a cyclic route and loading of transport vehicles
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 5:1 (1998),  12–18
7. On problems of efficient barter
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 5:1 (1998),  3–11
8. On some problems of mutual amortization of enterprises
   
   Diskretn. Anal. Issled. Oper., Ser. 2, 4:1 (1997),  30–39
9. On the complexity of some generalizations of Johnson's two-machine problem
   
   Diskretn. Anal. Issled. Oper., 3:1 (1996),  80–90
10. On the smallest independent dominating sets in graphs
    
    Sibirsk. Zh. Issled. Oper., 1:4 (1994),  7–21
11. An algorithm for the approximate solution of the traveling salesman problem and its probabilistic analysis
    
    Sibirsk. Zh. Issled. Oper., 1:2 (1994),  8–17
12. The problem of rigging a hierarchical control and communications system
    
    Trudy Inst. Mat. SO RAN, 28 (1994),  53–62
13. Basis systems and the problem of minimization on an intersection of basis systems
    
    Upravliaemie systemy, 1984, no. 25,  58–67
14. Minimization of a convex separable function on an intersection of polymatroids
    
    Upravliaemie systemy, 1983, no. 23,  33–43
15. Applicability of the coordinate-wise slope method to some problems of convex integer programming
    
    Upravliaemie systemy, 1978, no. 17,  52–59
16. Some cases of reducibility of Johnson's $m$-machine problem to a problem of two machines
    
    Upravliaemie systemy, 1978, no. 17,  46–51
17. On a method of constructing a lower estimate and an approximate solution with an aposteriori exactness estimation for a standardization problem
    
    Upravliaemie systemy, 1974, no. 13,  26–31
18. Исследования по теории расписаний
    
    Upravliaemie systemy, 1974, no. 12,  3–10
19. Об одном классе задач выпуклого целочисленного программирования
    
    Upravliaemie systemy, 1973, no. 11,  38–42
20. О динамике развития однородных технических систем
    
    Upravliaemie systemy, 1971, no. 8,  51–67
21. A certain generalization of Kakutani's fixed point theorem
    
    Dokl. Akad. Nauk SSSR, 185:5 (1969),  981–983
22. Алгоритм составления оптимального расписания для двух работ
    
    Upravliaemie systemy, 1968, no. 1,  14–20
23. The ranges of certain vector functions depending on systems of sets
    
    Sibirsk. Mat. Zh., 5:4 (1964),  778–782
24. Representation of operators over memory
    
    Dokl. Akad. Nauk SSSR, 144:3 (1962),  516–519