Geodesic
Some forms of stability of a~combinatorial problem of lexicographic optimization
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1998), pp. 11-21.

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

@article{IVM_1998_12_a1,
     author = {R. A. Berdysheva and V. A. Emelichev},
     title = {Some forms of stability of a~combinatorial problem of lexicographic optimization},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {11--21},
     publisher = {mathdoc},
     number = {12},
     year = {1998},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1998_12_a1/}
}
TY  - JOUR
AU  - R. A. Berdysheva
AU  - V. A. Emelichev
TI  - Some forms of stability of a~combinatorial problem of lexicographic optimization
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1998
SP  - 11
EP  - 21
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1998_12_a1/
LA  - ru
ID  - IVM_1998_12_a1
ER  - 
%0 Journal Article
%A R. A. Berdysheva
%A V. A. Emelichev
%T Some forms of stability of a~combinatorial problem of lexicographic optimization
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1998
%P 11-21
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1998_12_a1/
%G ru
%F IVM_1998_12_a1
R. A. Berdysheva; V. A. Emelichev. Some forms of stability of a~combinatorial problem of lexicographic optimization. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1998), pp. 11-21. http://geodesic.mathdoc.fr/item/IVM_1998_12_a1/

[1] Sergienko I. V., Kozeratskaya L. N., Lebedeva T. T., Issledovanie ustoichivosti i parametricheskii analiz diskretnykh optimizatsionnykh zadach, Nauk. dumka, Kiev, 1995, 169 pp. | Zbl

[2] Kozeratskaya L. N., Lebedeva T. T., Sergienko I. V., “Issledovanie ustoichivosti zadach diskretnoi optimizatsii”, Kibernet. i sistem. anal., 1993, no. 3, 78–93 | MR | Zbl

[3] Sotskov Yu. N., Leontev V. K., Gordeev E. N., “Some concepts of stability analysis in combinatorial optimization”, Discr. Appl. Math., 58 (1995), 169–190 | DOI | MR | Zbl

[4] Leontev V. K., “Ustoichivost zadachi kommivoyazhera”, Zhurn. vychisl. matem. i matem. fiz., 15:5 (1975), 1293–1309 | MR

[5] Leontev V. K., “Ustoichivost v lineinykh diskretnykh zadachakh”, Probl. kibernetiki, no. 35, M., 1979, 169–184 | MR

[6] Leontev V. K., Gordeev E. N., “Kachestvennoe issledovanie traektornykh zadach”, Kibernetika, 1986, no. 5, 82–90 | MR

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

[8] Kozeratskaya L. N., Lebedeva T. T., Sergienko T. I., “Voprosy parametricheskogo analiza i issledovaniya ustoichivosti mnogokriterialnykh zadach tselochislennogo lineinogo programmirovaniya”, Kibernetika, 1988, no. 3, 41–44 | MR | Zbl

[9] Kozeratskaya L. N., Lebedeva T. T., Sergienko T. I., “Zadachi tselochislennogo programmirovaniya s vektornym kriteriem: parametricheskii analiz i issledovanie ustoichivosti”, DAN SSSR, 307:3 (1989), 527–529

[10] Kozeratskaya L. N., Lebedeva T. T., Sergienko T. I., “Zadacha chastichno-tselochislennoi vektornoi optimizatsii: voprosy ustoichivosti”, Kibernetika, 1991, no. 1, 58–60 | MR | Zbl

[11] Bakurova A. V., Emelichev V. A., Perepelitsa V. A., “Ob ustoichivosti mnogokriterialnykh zadach na sistemakh podmnozhestv”, Dokl. AN Belarusi, 39:2 (1995), 33–35 | MR

[12] Emelichev V. A., Kravtsov M. K., “Ob ustoichivosti v traektornykh zadachakh vektornoi optimizatsii”, Kibernet. i sistem. anal., 1995, no. 4, 137–143 | MR | Zbl

[13] Emelichev V. A., Kravtsov M. K., Podkopaev D. P., “O radiuse kvaziustoichivosti mnogokriterialnoi traektornoi zadachi”, Dokl. AN Belarusi, 40:1 (1996), 9–12 | MR | Zbl

[14] Efimchik N. E., Podkopaev D. P., “O yadre i radiuse ustoichivosti v traektornoi zadache vektornoi diskretnoi optimizatsii”, Vestn. Belorussk. un-ta. Ser. 1, 1996, no. 1, 48–52 | MR | Zbl

[15] Emelichev V. A., Girlikh E., Podkopaev D. P., “Ob ustoichivosti effektivnykh reshenii vektornoi traektornoi zadachi diskretnoi optimizatsii, I”, Izv. AN Respubliki Moldova. Matematika, 1996, no. 3, 5–16 | MR | Zbl

[16] Emelichev V. A., Girlikh E., Podkopaev D. P., “Ob ustoichivosti effektivnykh reshenii vektornoi traektornoi zadachi diskretnoi optimizatsii, II”, Izv. AN Respubliki Moldova. Matematika, 1997, no. 2, 9–25 | MR

[17] Dinits E. A., “O reshenii dvukh zadach o naznachenii”, Issledov. po diskretnoi optimizatsii, M., 1976, 333–347

[18] Podinovskii V. V., Gavrilov V. M., Optimizatsiya po posledovatelno primenyaemym kriteriyam, Sov. radio, M., 1975, 192 pp. | MR | Zbl

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

[20] Sergienko I. V., Matematicheskie modeli i metody resheniya zadach diskretnoi optimizatsii, Nauk. dumka, Kiev, 1985, 384 pp. | MR

[21] Dubov Yu. A., Travkin S. I., Yakimets V. N., Mnogokriterialnye modeli formirovaniya i vybora variantov sistem, Nauka, M., 1986, 296 pp. | MR

[22] Emelichev V. A., Gladkii A. A., Yanushkevich O. A., “O mnogokriterialnykh zadachakh nakhozhdeniya leksikograficheskikh optimumov”, Izv. AN Belarusi. Ser. fiz.-matem. nauk, 1996, no. 3, 82–86 | MR | Zbl

[23] Emelichev V. A., Kravtsov M. K., Yanushkevich O. A., “Leksikograficheskie optimumy mnogokriterialnoi zadachi diskretnoi optimizatsii”, Matem. zametki, 58:3 (1995), 365–371 | MR

[24] Kolmogorov A. N., Fomin S. V., Elementy teorii funktsii i funktsionalnogo analiza, Nauka, M., 1972, 496 pp. | MR