Geodesic
Анализ устойчивости лексикографической булевой задачи минимизации модулей линейных функций
Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 1, pp. 59-71.

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

@article{DA_2007_14_1_a3,
     author = {E. Gurevsky and V. A. Emelichev},
     title = {{\CYRA}{\cyrn}{\cyra}{\cyrl}{\cyri}{\cyrz} {\cyru}{\cyrs}{\cyrt}{\cyro}{\cyrishrt}{\cyrch}{\cyri}{\cyrv}{\cyro}{\cyrs}{\cyrt}{\cyri} {\cyrl}{\cyre}{\cyrk}{\cyrs}{\cyri}{\cyrk}{\cyro}{\cyrg}{\cyrr}{\cyra}{\cyrf}{\cyri}{\cyrch}{\cyre}{\cyrs}{\cyrk}{\cyro}{\cyrishrt} {\cyrb}{\cyru}{\cyrl}{\cyre}{\cyrv}{\cyro}{\cyrishrt} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch}{\cyri} {\cyrm}{\cyri}{\cyrn}{\cyri}{\cyrm}{\cyri}{\cyrz}{\cyra}{\cyrc}{\cyri}{\cyri} {\cyrm}{\cyro}{\cyrd}{\cyru}{\cyrl}{\cyre}{\cyrishrt} {\cyrl}{\cyri}{\cyrn}{\cyre}{\cyrishrt}{\cyrn}{\cyrery}{\cyrh} {\cyrf}{\cyru}{\cyrn}{\cyrk}{\cyrc}{\cyri}{\cyrishrt}},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {59--71},
     publisher = {mathdoc},
     volume = {14},
     number = {1},
     year = {2007},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2007_14_1_a3/}
}
TY  - JOUR
AU  - E. Gurevsky
AU  - V. A. Emelichev
TI  - Анализ устойчивости лексикографической булевой задачи минимизации модулей линейных функций
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2007
SP  - 59
EP  - 71
VL  - 14
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2007_14_1_a3/
LA  - ru
ID  - DA_2007_14_1_a3
ER  - 
%0 Journal Article
%A E. Gurevsky
%A V. A. Emelichev
%T Анализ устойчивости лексикографической булевой задачи минимизации модулей линейных функций
%J Diskretnyj analiz i issledovanie operacij
%D 2007
%P 59-71
%V 14
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2007_14_1_a3/
%G ru
%F DA_2007_14_1_a3
E. Gurevsky; V. A. Emelichev. Анализ устойчивости лексикографической булевой задачи минимизации модулей линейных функций. Diskretnyj analiz i issledovanie operacij, Tome 14 (2007) no. 1, pp. 59-71. http://geodesic.mathdoc.fr/item/DA_2007_14_1_a3/

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

[2] Bukhtoyarov S. E., Emelichev V. A., “Parametrizatsiya printsipa optimalnosti (“ot Pareto do Sleitera”) i ustoichivost mnogokriterialnykh traektornykh zadach”, Diskret. analiz i issled. operatsii. Ser. 2, 10:2 (2003), 3–18 | MR

[3] Bukhtoyarov S. E., Emelichev V. A., Stepanishina Yu. V., “Voprosy ustoichivosti vektornykh diskretnykh zadach s parametricheskim printsipom optimalnosti”, Kibernetika i sistemnyi analiz, 2003, no. 4, 155–166 | MR | Zbl

[4] Emelichev V. A., Berdysheva R. A., “O radiuse ustoichivosti, kvaziustoichivosti i stabilnosti vektornoi traektornoi zadachi leksikograficheskoi optimizatsii”, Diskretnaya matematika, 10:1 (1998), 20–27 | MR | Zbl

[5] Emelichev V. A., Berdysheva R. A., “O mere ustoichivosti zadachi tselochislennoi vektornoi leksikograficheskoi optimizatsii”, Izv. NAN Belarusi. Ser. fiz.-mat. nauk, 1999, no. 4, 119–124 | MR

[6] Emelichev V. A., Kuzmin K. G., Leonovich A. M., “Ustoichivost v vektornykh kombinatornykh zadachakh optimizatsii”, Avtomatika i telemekhanika, 2004, no. 2, 79–92 | MR | Zbl

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

[8] Emelichev V. A., Podkopaev D. P., “Ustoichivost i regulyarizatsiya vektornykh zadach tselochislennogo lineinogo programmirovaniya”, Diskret. analiz i issled. operatsii. Ser. 2, 8:1 (2001), 47–69 | MR | Zbl

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

[10] Kolokolov A. A., Devyaterikova M. V., “Analiz ustoichivosti $L$-razbieniya mnozhestv v konechnomernom prostranstve”, Diskret. analiz i issled. operatsii. Ser. 2, 7:2 (2000), 47–53 | MR | Zbl

[11] Kolokolov A. A., Devyaterikova M. V., “Analiz ustoichivosti nekotorykh algoritmov diskretnoi optimizatsii”, Avtomatika i telemekhanika, 2004, no. 3, 48–54 | MR | Zbl

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

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

[14] Sergienko I. V.,Shilo V. P., Zadachi diskretnoi optimizatsii. Problemy, metody resheniya, issledovaniya, Naukova dumka, Kiev, 2003

[15] Sotskov Yu. N., Sotskova N. Yu., Teoriya raspisanii. Sistemy s neopredelënnymi chislovymi parametrami, NAN Belarusi, Minsk, 2004

[16] Chervak Yu. Yu., Optimizatsiya. Nepokraschuvanii vibir, Uzhgorodskii Natsionalnii universitet, Uzhgorod, 2002

[17] Devyaterikova M. V., Kolokolov A. A., “Analysis of $L$-structure stability of convex integer programming problems”, Operations Research Proceedings, Springer, 2000, 49–54 | MR

[18] Ehrgott M., Gandibleux X., “A survey and annotated bibliography of multiobjective combinatorial optimization”, OR Spectrum, 22:4 (2000), 425–460 | DOI | MR | Zbl

[19] Emelichev V. A., Girlich E., Nikulin Yu. V., Podkopaev D. P., “Stability and regularization of vector problems of integer linear programming”, Optimization, 51:4 (2002), 645–676 | DOI | MR | Zbl

[20] Greenberg H. J., “An annotated bibliography for post-solution analysis in mixed integer programming and combinatorial optimization”, Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search., Kluwer Acad. Publ., Boston, MA, 1998, 97–148 | MR

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