|
|
Publications in Math-Net.Ru |
Citations |
|
1999 |
1. |
V. A. Emelichev, A. V. Pashkevich, O. A. Yanushkevich, “Conditions for the efficiency of a solution of a vector discrete optimization problem”, Diskr. Mat., 11:1 (1999), 140–145 ; Discrete Math. Appl., 9:2 (1999), 155–160 |
1
|
2. |
V. A. Emelichev, O. A. Yanushkevich, “Regularization of a multicriterial integer linear programming problem”, Izv. Vyssh. Uchebn. Zaved. Mat., 1999, no. 12, 38–42 ; Russian Math. (Iz. VUZ), 43:12 (1999), 35–39 |
2
|
|
1998 |
3. |
V. A. Emelichev, O. A. Yanushkevich, “On problems of lexicographic optimization”, Diskretn. Anal. Issled. Oper., Ser. 1, 5:4 (1998), 30–37 |
1
|
4. |
M. K. Kravtsov, O. A. Yanushkevich, “A linear convolution of criteria in bicriterial optimization”, Izv. Vyssh. Uchebn. Zaved. Mat., 1998, no. 12, 63–70 ; Russian Math. (Iz. VUZ), 42:12 (1998), 60–66 |
|
1997 |
5. |
V. A. Emelichev, E. Girlikh, O. A. Yanushkevich, “Lexicographic optima of a multicriterial problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 4:2 (1997), 3–14 |
4
|
6. |
V. A. Emelichev, O. A. Yanushkevich, “Pareto-optimality conditions in discrete vector optimization problems”, Diskr. Mat., 9:3 (1997), 153–160 ; Discrete Math. Appl., 7:4 (1997), 345–352 |
2
|
7. |
M. K. Kravtsov, O. A. Yanushkevich, “Solvability of the vector problem by the linear criteria convolution algorithm”, Mat. Zametki, 62:4 (1997), 502–509 ; Math. Notes, 62:4 (1997), 420–425 |
2
|
8. |
V. A. Emelichev, M. K. Kravtsov, O. A. Yanushkevich, “Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria”, Zh. Vychisl. Mat. Mat. Fiz., 37:11 (1997), 1405–1408 ; Comput. Math. Math. Phys., 37:11 (1997), 1362–1365 |
1
|
|
1995 |
9. |
V. A. Emelichev, M. K. Kravtsov, O. A. Yanushkevich, “Conditions for Pareto optimality in a discrete vector problem on a system of subsets”, Zh. Vychisl. Mat. Mat. Fiz., 35:11 (1995), 1641–1652 ; Comput. Math. Math. Phys., 35:11 (1995), 1321–1329 |
2
|
|
Organisations |
|
|
|
|