Glebov N. I. K opisaniyu odnogo klassa zadach, razreshimykh algoritmom pokoordinatnogo pod'ema // Diskretnyi analiz i issledovanie operatsii. Seriya 1, 2001, t. 8, # 3, 15–25.
Glebov N. I., Kostochka A. V. O naimenshikh nezavisimykh dominiruyuschikh mnozhestvakh v grafakh // Sibirskii zhurnal issledovaniya operatsii, 1 (1994), # 4, 7–21.
Glebov N. I. O primenimosti metoda pokoordinatnogo spuska k nekotorym zadacham vypuklogo tselochislennogo programmirovaniya // Upravlyaemye sistemy: Sb. nauch. tr. Novosibirsk: In-t matematiki SO AN SSSR, 1978. Vyp. 17. S. 52–59.
Glebov N. I. O zadache minimizatsii vypukloi separabelnoi funktsii na peresechenii polimatroidov // Upravlyaemye sistemy: Sb. nauch. tr. Novosibirsk: In-t matematiki SO AN SSSR, 1983. Vyp. 23. S. 33–43.
A. E. Baburin, E. Kh. Gimadi, N. I. Glebov, A. V. Pyatkin, “The problem of finding a subset of vectors with the maximum total weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 32–42; J. Appl. Industr. Math., 2:1 (2008), 32–38
N. I. Glebov, “On conditions for the solvability of optimization problems by a greedy algorithm”, Diskretn. Anal. Issled. Oper., Ser. 2, 9:2 (2002), 3–12
N. I. Glebov, “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
N. I. Glebov, V. V. Shenmaier, “On the applicability of a coordinate-wise ascent algorithm to integer programming problems”, Diskretn. Anal. Issled. Oper., Ser. 1, 7:4 (2000), 38–47
E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov, “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
E. Kh. Gimadi, N. I. Glebov, V. V. Zalyubovskii, “On problems of efficient barter”, Diskretn. Anal. Issled. Oper., Ser. 2, 5:1 (1998), 3–11
1997
8.
E. Kh. Gimadi, N. I. Glebov, V. V. Zalyubovskii, “On some problems of mutual amortization of enterprises”, Diskretn. Anal. Issled. Oper., Ser. 2, 4:1 (1997), 30–39
A. G. Shchukin, N. I. Glebov, “On the complexity of some generalizations of Johnson's two-machine problem”, Diskretn. Anal. Issled. Oper., 3:1 (1996), 80–90
1994
10.
N. I. Glebov, A. V. Kostochka, “On the smallest independent dominating sets in graphs”, Sibirsk. Zh. Issled. Oper., 1:4 (1994), 7–21
11.
E. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov, “An algorithm for the approximate solution of the traveling salesman problem and its probabilistic analysis”, Sibirsk. Zh. Issled. Oper., 1:2 (1994), 8–17
E. Kh. Gimadi, N. I. Glebov, “The problem of rigging a hierarchical control and communications system”, Trudy Inst. Mat. SO RAN, 28 (1994), 53–62
1984
13.
N. I. Glebov, “Basis systems and the problem of minimization on an intersection of basis systems”, Upravliaemie systemy, 1984, no. 25, 58–67
1983
14.
N. I. Glebov, “Minimization of a convex separable function on an intersection of polymatroids”, Upravliaemie systemy, 1983, no. 23, 33–43
1978
15.
N. I. Glebov, “Applicability of the coordinate-wise slope method to some problems of convex integer programming”, Upravliaemie systemy, 1978, no. 17, 52–59
16.
N. I. Glebov, “Some cases of reducibility of Johnson's $m$-machine problem to a problem of two machines”, Upravliaemie systemy, 1978, no. 17, 46–51
1974
17.
E. Kh. Gimadi, N. I. Glebov, V. T. Dement'ev, “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.
E. Kh. Gimadi, N. I. Glebov, V. A. Perepelitsa, “Исследования по теории расписаний”, Upravliaemie systemy, 1974, no. 12, 3–10
1973
19.
N. I. Glebov, “Об одном классе задач выпуклого целочисленного программирования”, Upravliaemie systemy, 1973, no. 11, 38–42
1971
20.
N. I. Glebov, V. T. Dement'ev, A. N. Sychev, “О динамике развития однородных технических систем”, Upravliaemie systemy, 1971, no. 8, 51–67
1969
21.
N. I. Glebov, “A certain generalization of Kakutani's fixed point theorem”, Dokl. Akad. Nauk SSSR, 185:5 (1969), 981–983
Contact us: