Voir la notice du chapitre de livre provenant de la source Math-Net.Ru
[1] Papadimitriu Kh., Staiglits K., Kombinatornaya optimizatsiya. Algoritmy i slozhnost, Mir, M., 1985
[2] Saati T., Tselochislennye metody optimizatsii i svyazannye s nimi ekstremalnye problemy, Mir, M., 1973
[3] Gorbacheva O., “Ob odnom klasse zadach vypuklogo programmirovaniya”, Tr. III Zimnei shkoly po mat. programmirovaniyu. Vyp. II, 1970, M.
[4] Glebov N. I., “Ob odnom klasse zadach vypuklogo tselochislennogo programmirovaniya”, Upravlyaemye sistemy, 1973, no. 11, 38–42
[5] Ovchinnikov V. G., “Ob odnoi zadache nelineinogo programmirovaniya”, VI Vsesoyuz. konf. po ekstremalnym zadacham. Ch. 2, Tez. dokl. (16–19 aprelya 1973 g.), 1973, Tallin, 52
[6] Ovchinnikov V. G., “Ob odnoi zadache tselochislennogo programmirovaniya”, Kibernetika, 1976, no. 1, 131–135
[7] Ovchinnikov V. G., “Zhadnyi algoritm na supermatroidakh”, Tr. Vseros. nauchnoi konf. Ch. 2, Mat. modelirovanie i kraevye zadachi, Samara, 2004