|
|
Publications in Math-Net.Ru |
Citations |
|
1993 |
1. |
Yu. Yu. Finkel'shtein, “Klein polygons and reduced regular continued fractions”, Uspekhi Mat. Nauk, 48:3(291) (1993), 205–206 ; Russian Math. Surveys, 48:3 (1993), 198–200 |
7
|
|
1980 |
2. |
Yu. Yu. Finkel'shtein, “A polynomial $\varepsilon$-optimization algorithm in the multidimensional knapsack problem”, Zh. Vychisl. Mat. Mat. Fiz., 20:3 (1980), 800–802 ; U.S.S.R. Comput. Math. Math. Phys., 20:3 (1980), 274–276 |
|
1977 |
3. |
Yu. Yu. Finkel'shtein, “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 ; U.S.S.R. Comput. Math. Math. Phys., 17:4 (1977), 215–217 |
|
1970 |
4. |
Yu. Yu. Finkel'shtein, “An estimate of the number of iterations for Gomory's all-integer algorithm”, Dokl. Akad. Nauk SSSR, 193:3 (1970), 543–546 |
|
1967 |
5. |
A. A. Korbut, Yu. Yu. Finkel'shtein, “Discrete problems of mathematical programming”, Itogi Nauki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern. 1966, 1967, 59–108 ; Progr. Math., 3 (1969), 57–112 |
|
1965 |
6. |
Yu. Yu. Finkel'shtein, “An algorithm for solving integer linear programming problems with Boolean variables”, Dokl. Akad. Nauk SSSR, 164:5 (1965), 993–996 |
|
1963 |
7. |
Yu. Yu. Finkel'shtein, “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 ; U.S.S.R. Comput. Math. Math. Phys., 3:6 (1963), 1507–1519 |
1
|
|
Organisations |
|
|
|
|