Geodesic
Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 11, pp. 1405-1408 
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. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 37 (1997) no. 11, pp. 1405-1408. http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_11_a13/
@article{ZVMMF_1997_37_11_a13,
     author = {V. A. Emelichev and M. K. Kravtsov and O. A. Yanushkevich},
     title = {Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1405--1408},
     year = {1997},
     volume = {37},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_11_a13/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - M. K. Kravtsov
AU  - O. A. Yanushkevich
TI  - Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1997
SP  - 1405
EP  - 1408
VL  - 37
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_11_a13/
LA  - ru
ID  - ZVMMF_1997_37_11_a13
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A M. K. Kravtsov
%A O. A. Yanushkevich
%T Solvability of a class of discrete vector problems by the algorithms of linear convolution of criteria
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1997
%P 1405-1408
%V 37
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_1997_37_11_a13/
%G ru
%F ZVMMF_1997_37_11_a13

Voir la notice de l'article provenant de la source Math-Net.Ru

[1] Gordeev E. N., Leontev V. P., “Obschii podkhod k issledovaniyu ustoichivosti reshenii v zadachakh diskretnoi optimizatsii”, Zh. vychisl. matem. i matem. fiz., 36:1 (1996), 66–72 | MR | Zbl

[2] Emelichev V. A., Kravtsov M. K., “O nerazreshimosti vektornykh zadach diskretnoi optimizatsii na sistemakh podmnozhestv v klasse algoritmov lineinoi svertki kriteriev”, Dokl. RAN, 334:1 (1994), 9–11 | MR | Zbl

[3] Emelichev V. A., Kravtsov M. K., “O zadachakh vektornoi diskretnoi optimizatsii na sistemakh podmnozhestv, nerazreshimykh s pomoschyu algoritmov lineinoi svertki”, Zh. vychisl. matem. i matem. fiz., 34:7 (1994), 1082–1094 | MR | Zbl

[4] Melamed I. I., Sigal I. Kh., “Issledovanie lineinoi svertki kriteriev v mnogokriterialnom diskretnom programmirovanii”, Zh. vychisl. matem. i matem. fiz., 35:8 (1995), 1260–1270 | MR | Zbl

[5] Emelichev V. A., Kovalev M. M., Kravtsov M. K., Mnogogranniki, grafy, optimizatsiya, Nauka, M., 1981 | MR

[6] Emelichev V. A., Kravtsov M. K., Yanushkevich O. A., “Razreshimost vektornoi traektornoi zadachi na “uzkie mesta” s pomoschyu algoritma lineinoi svertki kriteriev”, Dokl. AN Belarusi, 40:4 (1996), 29–33 | MR | Zbl

[7] Emelichev V. A., Kravtsov M. K., Yanushkevich O. A., “Usloviya pareto-optimalnosti v odnoi diskretnoi vektornoi zadache na sistemakh podmnozhestv”, Zh. vychisl. matem. i matem. fiz., 35:11 (1995), 1641–1652 | MR | Zbl