On a quantitative measure of stability for a vector problem in integer programming
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 11, pp. 1801-1805 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1998_38_11_a1,
     author = {V. A. Emelichev and D. P. Podkopaev},
     title = {On a quantitative measure of stability for a vector problem in integer programming},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1801--1805},
     year = {1998},
     volume = {38},
     number = {11},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_11_a1/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - D. P. Podkopaev
TI  - On a quantitative measure of stability for a vector problem in integer programming
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1998
SP  - 1801
EP  - 1805
VL  - 38
IS  - 11
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_11_a1/
LA  - ru
ID  - ZVMMF_1998_38_11_a1
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A D. P. Podkopaev
%T On a quantitative measure of stability for a vector problem in integer programming
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1998
%P 1801-1805
%V 38
%N 11
%U http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_11_a1/
%G ru
%F ZVMMF_1998_38_11_a1
V. A. Emelichev; D. P. Podkopaev. On a quantitative measure of stability for a vector problem in integer programming. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 38 (1998) no. 11, pp. 1801-1805. http://geodesic.mathdoc.fr/item/ZVMMF_1998_38_11_a1/

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

[2] Leontev V. K., “Ustoichivost v lineinykh diskretnykh zadachakh”, Probl. kibernetiki, 35 (1979), 169–184 | MR

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

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

[5] Emelichev V. A., Kravtsov M. K., “Ob ustoichivosti v traektornykh zadachakh vektornoi optimizatsii”, Kibernetika i sistemnyi analiz, 1995, no. 4, 137–143 | MR | Zbl

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

[7] Kozeratskaya L. N., Lebedeva T. T., Sergienko I. V., “Issledovanie ustoichivosti zadach diskretnoi optimizatsii”, Kibernetika i sistemnyi analiz, 1993, no. 3, 78–93 | MR | Zbl

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

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

[10] Emelichev V. A., Kravtsov M. K., Podkopaev D. P., “O kvaziustoichivosti traektornykh zadach vektornoi optimizatsii”, Matem. zametki, 63:1 (1998), 21–27 | MR | Zbl

[11] Smale S., “Global analysis and economics. V. Pareto theory with constraints”, J. Math. Econ., 1:3 (1974), 213–221 | DOI | MR | Zbl