Voir la notice de l'article provenant de la source Math-Net.Ru
@article{PDMA_2013_6_a47, author = {N. V. Anashkina}, title = {About possibility of reduction of sort out in {Balash's} algorithm}, journal = {Prikladnaya Diskretnaya Matematika. Supplement}, pages = {105--107}, publisher = {mathdoc}, number = {6}, year = {2013}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/PDMA_2013_6_a47/} }
N. V. Anashkina. About possibility of reduction of sort out in Balash's algorithm. Prikladnaya Diskretnaya Matematika. Supplement, no. 6 (2013), pp. 105-107. http://geodesic.mathdoc.fr/item/PDMA_2013_6_a47/
[1] Balakin G. V., Nikonov V. G., “Metody svedeniya bulevykh uravnenii k sistemam porogovykh sootnoshenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 1:3 (1994), 389–401 | MR
[2] Rybnikov K. K., Nikonov N. V., “Prikladnye zadachi, svodyaschiesya k analizu i resheniyu sistem lineinykh neravenstv. Metod razdelyayuschikh ploskostei”, Vestnik Moskovskogo gosudarstvennogo universiteta lesa — Lesnoi vestnik, 2002, no. 2(22), 191–195
[3] Anashkina N. V., “Ispolzovanie algoritma Balasha dlya nakhozhdeniya resheniya sistemy lineinykh ogranichenii spetsialnogo vida”, Vestnik Moskovskogo gosudarstvennogo universiteta lesa — Lesnoi vestnik, 2004, no. 4(35), 176–179 | MR | Zbl
[4] Kofman A., Anri-Laborder A., Metody i modeli issledovaniya operatsii, Mir, M., 1977, 432 pp.
[5] Anashkina N. V., “Obzor metodov resheniya sistem lineinykh neravenstv”, Vestnik Moskovskogo gosudarstvennogo universiteta lesa — Lesnoi vestnik, 2004, no. 1(32), 144–148
[6] Grishukhin V. P., “Srednee chislo iteratsii v algoritme Balasha”, Chislennye metody v lineinom programmirovanii, Cb. statei, Nauka, M., 1973, 31–38