@article{ZVMMF_2010_50_9_a12,
author = {M. K. Kerimov},
title = {In memory of {Aloizas-Iozapas} {Antano} {Stanevichyus} (1940{\textendash}2009)},
journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
pages = {1709--1712},
year = {2010},
volume = {50},
number = {9},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_9_a12/}
}
M. K. Kerimov. In memory of Aloizas-Iozapas Antano Stanevichyus (1940–2009). Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 50 (2010) no. 9, pp. 1709-1712. http://geodesic.mathdoc.fr/item/ZVMMF_2010_50_9_a12/
[1] Stanevichyus A. A., “Osobennosti realizatsii vychislitelnoi skhemy multiplikativnogo algoritma simpleks-metoda na EVM”, Tr. Vses. NII mekhanizatsii selskogo khozyaistva, 45, 1968, 0.9 pech. lista
[2] Stanevichyus A. A., “LP-yazyk”, Algoritmy i algoritmich. yazyki, 5, VTs AN SSSR, M., 1971, 94–104 (with L. I. Goncharovoi), 0.9 pech. lista
[3] Stanevichyus A. A., Optimalnoe planirovanie energokhozyaistva raiona i ego algoritmicheskoe obespechenie, Dis. ...kand. ekonomich. nauk, TsEMI AN SSSR, M., 1971
[4] Stanevichyus A. A., Multikompleks LP - BESM-6, Programmy i algoritmy, 49, TsEMI AN SSSR, M., 1974, 7 pech. listov
[5] Stanevichyus A. A., “Sistema modulei dlya resheniya zadach lineinogo programmirovaniya na BESM-6”, Probl. povysheniya effektivnosti BESM-6, Vilnyus, 1974, 111–117 (with N. K. Burovoi, L. I. Stanevichene, A. V. Tyulenevym)
[6] Stanevichyus A. A., Soglasovanie i analiz reshenii optimizatsionnykh zadach, Nauka, M., 1976 (with s kollektivom avtorov), 15 pech. listov
[7] Stanevichyus A. A., “Sistema LP - BESM-6”, Probl. povysheniya effektivnosti BESM-6, Irkutsk, 1976, 153–157 (with N. K. Burovoi, L. I. Stanevichene, A. V. Tyulenevym)
[8] Stanevichyus A. A., “Ispolzovanie spetsifiki uslovii zadachi v treugolno-multiplikativnom algoritme”, Probl. sozdaniya programmnogo obespecheniya resheniya zadach optimalnogo planirovaniya, M., 1977, 20–28 (with N. K. Burovoi, I. N. Ziminym, Yu. G. Padchim)
[9] Stanevichyus A. A., “Programmnoe obespechenie simpleks-metoda dlya zadach bolshikh razmerov”, Sovrem. sostoyanie teorii issl. operatsii, Nauka, M., 1979, 451–464 (with I. V. Romanovskim)
[10] Stanevichyus A. A., “O metodakh tochnogo resheniya zadachi krossovoi kommutatsii”, Tekhnika sredstv svyazi. Ser. SS, 1980, no. 3, 49–55 (with Yu. E. Malashenko)
[11] Stanevichyus A. A., “O reshenii odnoi zadachi tselochislennogo programmirovaniya”, Zh. vychisl. metam. i matem. fiz., 20:3 (1980), 623–629 (with Yu. E. Malashenko) | MR
[12] Stanevichyus A. A., Sistema lineinogo programmirovaniya LP - BESM-6, Izd-vo VTs AN SSSR, M., 1981 (with N. K. Burovoi, L. I. Stanevichene, P. E. Shklyarom), 128 pp.
[13] Stanevichyus A. A., “O paketakh i vychislitelnykh metodakh lineinogo programmirovaniya”, Chisl. metody sploshnoi sredy, VTs SO AN SSSR, Novosibirsk, 1981, 62–78 (with U. Kh. Malkovym)
[14] Stanevichyus A. A., “Zamechaniya k algoritmu simpleks-metoda dlya zadach bolshikh razmerov”, Zh. vychisl. metam. i matem. fiz., 22:1 (1982), 90–99 (with P. E. Shklyarom) | MR | Zbl
[15] Stanevichyus A. A., “Metod resheniya zadachi krossirovki kak zadachi tselochislennogo programmirovaniya”, Matem. kibernetika i prikl. matem., 6, Baku, 1983, 29–40 (with B. A. Guseinovym) | MR | Zbl
[16] Stanevichyus A. A., “Novaya versiya sistemy lineinogo programmirovaniya LP/BESM-6”, Pakety prikl. programm. Metody optimizatsii, Nauka, M., 1984, 47–59
[17] Stanevichyus A. A., “Paket prikladnykh programm MGD dlya generirovaniya vkhodnykh dannykh paketov lineinogo programmirovaniya v MPS-formate”, Algoritmy i programmy, Inform. byul. VNTITsentra, 70, 1986 (with I. V. Mironovoi), 80 pp., 3 pech. lista
[18] Stanevichyus A. A., “Yazykovye sredstva paketa MGD dlya generirovaniya lineinykh modelei”, Pakety prikl. programm. Programmnoe obespechenie optimizatsionnykh zadach, Nauka, M., 1987, 90–98 (with E. T. Izimbetovym)
[19] Stanevichyus A. A., Barerno-nyutonovskie metody zadach lineinogo programmirovaniya s dvustoronnimi ogranicheniyami, VTs RAN, M., 1994 (with L. V. Scherbak), 64 pp.
[20] Stanevichyus A. A., “On iteration process of barrier-Newton method for solving linear programming problems”, Abstract of 17 IFIP TC7 Conf. on System Modeling and Optimizat., Prague, 1995, 480–489 (with L. V. Scherbak)
[21] Stanevichyus A. A., “Novye varianty barerno-nyutonovskikh metodov dlya resheniya zadach lineinogo programmirovaniya”, Zh. vychisl. metam. i matem. fiz., 35:12 (1995), 1796–1807 (with L. V. Scherbak) | MR
[22] Stanevichyus A. A., “Funktsii nevyazok v iteratsionnom protsesse barerno-nyutonovskogo metoda pri reshenii obschei zadachi lineinogo programmirovaniya”, Izv. vuzov. Matematika, 1995, no. 12, 89–98 (with L. V. Scherbak) | MR | Zbl
[23] Stanevichyus A. A., “Utochnenie resheniya zadachi LP na iteratsiyakh simpleks-metoda”, Algebra i lineinaya optimizatsiya, Tr. Mezhdunar. seminara, Ekaterinburg, 2002 (with P. E. Shklyarom), 3 pp.
[24] Stanevichyus A. A., “Paket programm lineinogo programmirovaniya LP-Pentium”, Nauchn. otchet VTs RAN, M., 2002 (with P. E. Shklyarom, M. Yu. Lebedevym), 29 pp.
[25] Stanevichyus A. A., “Parallelnyi variant simpleks-metoda dlya resheniya zadachi lineinogo programmirovaniya”, Nauchn. otchet VTs RAN, M., 2003 (with P. E. Shklyarom, M. Yu. Lebedevym), 29 pp.
[26] Stanevichyus A. A., Metod Nyutona dlya zadach lineinogo programmirovaniya s dvustoronnimi ogranicheniyami, VTs RAN, M., 2005 (with V. G. Zhadanom), 64 pp.