Geodesic
On the stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero
Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2006), pp. 27-32.

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

@article{IVM_2006_12_a2,
     author = {E. Gurevsky and V. A. Emelichev},
     title = {On the stability of the vector {Boolean} problem of minimizing absolute deviations of linear functions from zero},
     journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
     pages = {27--32},
     publisher = {mathdoc},
     number = {12},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/IVM_2006_12_a2/}
}
TY  - JOUR
AU  - E. Gurevsky
AU  - V. A. Emelichev
TI  - On the stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero
JO  - Izvestiâ vysših učebnyh zavedenij. Matematika
PY  - 2006
SP  - 27
EP  - 32
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/IVM_2006_12_a2/
LA  - ru
ID  - IVM_2006_12_a2
ER  - 
%0 Journal Article
%A E. Gurevsky
%A V. A. Emelichev
%T On the stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero
%J Izvestiâ vysših učebnyh zavedenij. Matematika
%D 2006
%P 27-32
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/IVM_2006_12_a2/
%G ru
%F IVM_2006_12_a2
E. Gurevsky; V. A. Emelichev. On the stability of the vector Boolean problem of minimizing absolute deviations of linear functions from zero. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 12 (2006), pp. 27-32. http://geodesic.mathdoc.fr/item/IVM_2006_12_a2/

[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] Sergienko I. V., Shilo V. P., Zadachi diskretnoi optimizatsii. Problemy, metody resheniya, issledovaniya, Nauk. dumka, Kiev, 2003, 261 pp.

[3] Sotskov Yu. N., Sotskova N. Yu., Teoriya raspisanii. Sistemy s neopredelennymi chislovymi parametrami, OIPI NAN Belarusi, Minsk, 2004, 290 pp.

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

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

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

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

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

[9] Sotskov Yu. N., “Issledovanie ustoichivosti optimalnykh raspisanii”, Informatika, 2004, no. 4, 65–75

[10] Emelichev V. A., Krichko V. N., “Formula radiusa ustoichivosti vektornoi $l_\infty$-ekstremalnoi traektornoi zadachi”, Diskretnaya matem., 16:1 (2004), 14–20 | MR | Zbl

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

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

[13] Emelichev V. A., Yanushkevich O. A., “O regulyarizatsii mnogokriterialnoi zadachi tselochislennogo lineinogo programmirovaniya”, Izv. vuzov. Matematika, 1999, no. 12, 38–42 | MR | Zbl

[14] Chirkov A. Yu., Shevchenko V. N., Zolotykh N. Yu., “O mnogokriterialnoi zadache tselochislennogo lineinogo programmirovaniya”, Diskretnyi analiz i issledovanie operatsii. Ser. 2, 12:2 (2005), 72–84 | MR