|
|
|
Publications in Math-Net.Ru |
Citations |
|
1997 |
| 1. |
V. G. Anisimov, E. G. Anisimov, “A modification of a method for a class of problems in integer programming”, Zh. Vychisl. Mat. Mat. Fiz., 37:2 (1997), 179–183    ; Comput. Math. Math. Phys., 37:2 (1997), 175–179 |
6
|
| 2. |
V. G. Anisimov, E. G. Anisimov, “Algorithm for optimal distribution of discrete nonuniform resources on a network”, Zh. Vychisl. Mat. Mat. Fiz., 37:1 (1997), 54–60 ; Comput. Math. Math. Phys., 37:1 (1997), 51–57 |
3
|
|
1992 |
| 3. |
V. G. Anisimov, E. G. Anisimov, “A branch-and-bound algorithm for one class of scheduling problem”, Zh. Vychisl. Mat. Mat. Fiz., 32:12 (1992), 2000–2005 ; Comput. Math. Math. Phys., 32:12 (1992), 1827–1832  |
8
|
|
1989 |
| 4. |
V. G. Anisimov, E. G. Anisimov, “A method of solving one class of integer programming problems”, Zh. Vychisl. Mat. Mat. Fiz., 29:10 (1989), 1586–1590 ; U.S.S.R. Comput. Math. Math. Phys., 29:5 (1989), 238–241 |
11
|
|
1985 |
| 5. |
A. O. Alekseev, O. G. Alekseev, V. G. Anisimov, E. G. Anisimov, “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 ; U.S.S.R. Comput. Math. Math. Phys., 25:6 (1985), 50–54 |
11
|
|
