Geodesic
Conditions for Pareto optimality in a discrete vector problem on a system of subsets
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 11, pp. 1641-1652 
V. A. Emelichev; M. K. Kravtsov; O. A. Yanushkevich. Conditions for Pareto optimality in a discrete vector problem on a system of subsets. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 35 (1995) no. 11, pp. 1641-1652. http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_11_a3/
@article{ZVMMF_1995_35_11_a3,
     author = {V. A. Emelichev and M. K. Kravtsov and O. A. Yanushkevich},
     title = {Conditions for {Pareto} optimality in a discrete vector problem on a system of subsets},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1641--1652},
     year = {1995},
     volume = {35},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_11_a3/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - M. K. Kravtsov
AU  - O. A. Yanushkevich
TI  - Conditions for Pareto optimality in a discrete vector problem on a system of subsets
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1995
SP  - 1641
EP  - 1652
VL  - 35
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_11_a3/
LA  - ru
ID  - ZVMMF_1995_35_11_a3
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A M. K. Kravtsov
%A O. A. Yanushkevich
%T Conditions for Pareto optimality in a discrete vector problem on a system of subsets
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1995
%P 1641-1652
%V 35
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_1995_35_11_a3/
%G ru
%F ZVMMF_1995_35_11_a3

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

[1] Podinovskii V. V., Nogin V. D., Pareto-optimalnye resheniya mnogokriterialnykh zadach, Nauka, M., 1982 | MR

[2] Burkard R. E., Keiding H., Krarup J., Pruzan P. M., “A relationship between optimality and efficiency in multicriteria 0-1 programming problems”, Comput. and Operat. Res., 8:4 (1981), 241–247 | DOI

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

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

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

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

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

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

[9] Burkard R. E., Krarup J., Pruzan P. M., “Some relationships between multicriteria and parametric discrete optimization problems with bottleneck objectives”, Math. Operationsforsch. und Statist. Ser. Optimizat., 15:3 (1984), 389–395 | MR | Zbl