Voir la notice de l'article provenant de la source Math-Net.Ru
@article{MMKZ_2004_2_a61, author = {V. G. Ovchinnikov}, title = {{\CYRZH}{\cyra}{\cyrd}{\cyrn}{\cyrery}{\cyrishrt} {\cyra}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm} {\cyrn}{\cyra} {\cyrs}{\cyru}{\cyrp}{\cyre}{\cyrr}{\cyrm}{\cyra}{\cyrt}{\cyrr}{\cyro}{\cyri}{\cyrd}{\cyra}{\cyrh}}, journal = {Matematicheskoe Modelirovanie i Kraevye Zadachi}, pages = {187--190}, publisher = {mathdoc}, volume = {2}, year = {2004}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/MMKZ_2004_2_a61/} }
V. G. Ovchinnikov. Жадный алгоритм на суперматроидах. Matematicheskoe Modelirovanie i Kraevye Zadachi, Proceedings of the All-Russian Scientific Conference (26–28 May 2004). Part 2, Tome 2 (2004), pp. 187-190. http://geodesic.mathdoc.fr/item/MMKZ_2004_2_a61/
[1] Papadimitriu Kh., Staiglits K., Kombinatornaya optimizatsiya. Algoritmy i slozhnost, Mir, M., 1985, 512 pp. | MR
[2] Ovchinnikov V. G., “Ob odnoi zadache nelineinogo programmirovaniya”, VI Vsesoyuznaya konferentsiya po ekstremalnym zadacham, Tezisy dokladov. Ch. 2 (16–19 aprelya 1973 g. Tallin), 1973, 52
[3] Ovchinnikov V. G., “Ob odnoi zadache tselochislennogo programmirovaniya”, Kibernetika, 1976, no. 1, 131–135 | MR | Zbl
[4] Glebov N. I., “Ob odnom klasse zadach vypuklogo tselochislennogo programmirovaniya”, Upravlyaemye sistemy, no. 11, Novosibirsk, 1973, 38–42
[5] Emelichev V. A., Ovchinnikov V. G., “Simmetrichnye supermatroidy”, Dokl. AN BSSR, 27:5 (1983), 389–391 | MR | Zbl
[6] Kovalev M. M., “Metod chastichnykh poryadkov”, Dokl. AN BSSR, 24:2 (1980), 113–116 | MR | Zbl