Publications in Math-Net.Ru
-
Klein polygons and reduced regular continued fractions
Uspekhi Mat. Nauk, 48:3(291) (1993), 205–206
-
A polynomial $\varepsilon$-optimization algorithm in the multidimensional knapsack problem
Zh. Vychisl. Mat. Mat. Fiz., 20:3 (1980), 800–802
-
The $\varepsilon $-approach to the multidimensional knapsack problem: the polynomial growth of the branching tree
Zh. Vychisl. Mat. Mat. Fiz., 17:4 (1977), 1040–1042
-
An estimate of the number of iterations for Gomory's all-integer algorithm
Dokl. Akad. Nauk SSSR, 193:3 (1970), 543–546
-
Discrete problems of mathematical programming
Itogi Nauki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern. 1966, 1967, 59–108
-
An algorithm for solving integer linear programming problems with Boolean variables
Dokl. Akad. Nauk SSSR, 164:5 (1965), 993–996
-
An iteration method for the solution of the transport problem with an additional linear restriction and an estimate of the number of iterations
Zh. Vychisl. Mat. Mat. Fiz., 3:6 (1963), 1103–1111
© , 2024