Geodesic
Regularization of a~multicriterial integer linear programming problem
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1999), pp. 38-42.

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

@article{IVM_1999_12_a3,
     author = {V. A. Emelichev and O. A. Yanushkevich},
     title = {Regularization of a~multicriterial integer linear programming problem},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {38--42},
     publisher = {mathdoc},
     number = {12},
     year = {1999},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_1999_12_a3/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - O. A. Yanushkevich
TI  - Regularization of a~multicriterial integer linear programming problem
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 1999
SP  - 38
EP  - 42
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_1999_12_a3/
LA  - ru
ID  - IVM_1999_12_a3
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A O. A. Yanushkevich
%T Regularization of a~multicriterial integer linear programming problem
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 1999
%P 38-42
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_1999_12_a3/
%G ru
%F IVM_1999_12_a3
V. A. Emelichev; O. A. Yanushkevich. Regularization of a~multicriterial integer linear programming problem. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (1999), pp. 38-42. http://geodesic.mathdoc.fr/item/IVM_1999_12_a3/

[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”, Kibernetika i sistemn. analiz, 1993, no. 3, 78–93 | MR | Zbl

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

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

[5] Emelichev V. A., Podkopaev D. P., “O kolichestvennoi mere ustoichivosti vektornoi zadachi tselochislennogo programmirovaniya”, Zhurn. vychisl. matem. i matem. fiz., 38:11 (1998), 1801–1805 | MR | Zbl

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

[7] Molodtsov D. A., Ustoichivost printsipov optimalnosti, Nauka, M., 1987, 280 pp. | MR | Zbl

[8] Belousov E. G., Andronov V. G., Razreshimost i ustoichivost zadach polinomialnogo programmirovaniya, Izd-vo MGU, M., 1993, 272 pp. | MR | Zbl

[9] Ashmanov S. A., Lineinoe programmirovanie, Nauka, M., 1981, 340 pp. | Zbl

[10] Kozeratskaya L. N., Lebedeva T. T., Sergienko T. I., “O regulyarizatsii zadach tselochislennoi vektornoi optimizatsii”, Kibernetika i sistemn. analiz, 1993, no. 3, 172–176 | MR | Zbl