Geodesic
Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 7, pp. 1082-1094 
V. A. Emelichev; M. K. Kravtsov. Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 7, pp. 1082-1094. http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_7_a9/
@article{ZVMMF_1994_34_7_a9,
     author = {V. A. Emelichev and M. K. Kravtsov},
     title = {Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1082--1094},
     year = {1994},
     volume = {34},
     number = {7},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_7_a9/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - M. K. Kravtsov
TI  - Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1994
SP  - 1082
EP  - 1094
VL  - 34
IS  - 7
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_7_a9/
LA  - ru
ID  - ZVMMF_1994_34_7_a9
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A M. K. Kravtsov
%T Problems of discrete vector optimization on systems of subsets which cannot be solved using a linear convolution algorithm
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1994
%P 1082-1094
%V 34
%N 7
%U http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_7_a9/
%G ru
%F ZVMMF_1994_34_7_a9

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

[1] Papadimitriu X., Staiglits K., Kombinatornaya optimizatsiya, algoritmy i slozhnost, Mir, M., 1985 | MR

[2] Geri M., Dzhonson D., Vychislitelnye mashiny i trudnoreshaemye zadachi, Mir, M., 1982 | MR

[3] Mikhalevich V. S., Trubin V. A , Shor N. Z., Optimizatsionnye zadachi proizvodstvenno-transportnogo planirovaniya: Modeli, metody, algoritmy, Nauka, M., 1968 | MR

[4] Mikhalevich V. S., Volkovich V. L., Vychislitelnye metody issledovaniya i proektirovaniya slozhnykh sistem, Nauka, M., 1982 | MR | Zbl

[5] Moiseev N. N., Matematicheskie zadachi sistemnogo analiza, Nauka, M., 1981 | MR

[6] Emelichev V. A., Perepelitsa V. A., “Mnogokriterialnye zadachi ob ostovakh grafa”, Dokl. AN SSSR, 298:3 (1988), 544–547 | Zbl

[7] Emelichev V. A., Perepeliza V. A., “Complexity of vector optimization problems on graphs”, Optimization, 22:6 (1991), 903–918 | MR | Zbl

[8] Emelichev V. A., Perepelitsa V. A., “K vychislitelnoi slozhnosti mnogokriterialnykh zadach”, Izv. AN SSSR. Tekhn. kibernetika, 1988, no. 1, 78–85

[9] Emelichev V. A., Perepelitsa V. A., “O nekotorykh algoritmicheskikh problemakh mnogokriterialnoi optimizatsii na grafakh”, Zh. vychisl. matem. i matem. fiz., 29:2 (1989), 171–183 | MR

[10] Emelichev V. A., Perepelitsa V. A., “O nerazreshimosti s pomoschyu algoritmov lineinoi svertki vektornykh zadach na grafakh”, VI Tiraspolskii simpozium po obschei topologii i ee primeneniyam, Moldavskii un-t, Kishinev, 1991, 82–83

[11] Emelichev V. A., Perepelitsa V. A., “K otsenke slozhnosti mnogokriterialnykh transportnykh zadach”, Dokl. AN BSSR, 30:7 (1986), 593–596 | MR | Zbl

[12] Kravtsov M. K., “Voprosy poliedralnoi kombinatoriki v transportnykh zadachakh s zapretami”, Kibernetika, 1990, no. 6, 63–84 | MR | Zbl

[13] 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

[14] Korbut A. A., Finkelshtein Yu. Yu., Diskretnoe programmirovanie, Nauka, M., 1969 | MR | Zbl

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

[16] Emelichev V. A., Kravtsov M. K., “Poliedralnye aspekty mnogoindeksnykh aksialnykh transportnykh zadach”, Diskretnaya matem., 3:2 (1991), 3–24

[17] Kravtsov M. K., Sherman A. X., “O reshenii kombinatornykh zadach optimizatsii s minimaksnymi kriteriyami”, Kibernetika, 1989, no. 3, 71–77 | MR | Zbl

[18] Kravtsov M. K., Sherman A. X., “Algoritm resheniya transportnoi zadachi spetsialnogo vida”, Matem. modeli i metody v avtomatizirovannykh sistemakh, 1, Izd-vo NIIEMP pri Gosplane BSSR, Minsk., 1975, 44–51

[19] Kovalev M. M., Diskretnaya optimizatsiya, BGU, Minsk, 1977

[20] Emelichev V. A., Melnikov O. I., Sarvanov V. I., Tyshkevich R. I., Lektsii po teorii grafov, Nauka, M., 1990 | MR | Zbl

[21] Kristofides I., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978 | MR

[22] Perepelitsa V. A., Mnogokriterialnye zadachi teorii grafov. Algoritmicheskii podkhod, Uchebnoe posobie, UMK VO, Kiev, 1989

[23] Emelichev V. A., Perepelitsa V. A., Shungarov X. D., “Asimptoticheskii podkhod k mnogokriterialnoi zadache pokrytiya grafa zvezdami”, Dokl. AN BSSR, 31:5 (1987), 430–433 | MR | Zbl

[24] Basaker R., Saati T., Konechnye grafy i seti, Nauka, M., 1974 | MR