Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_1968_1_a2, author = {N. I. Glebov}, title = {{\CYRA}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm} {\cyrs}{\cyro}{\cyrs}{\cyrt}{\cyra}{\cyrv}{\cyrl}{\cyre}{\cyrn}{\cyri}{\cyrya} {\cyro}{\cyrp}{\cyrt}{\cyri}{\cyrm}{\cyra}{\cyrl}{\cyrsftsn}{\cyrn}{\cyro}{\cyrg}{\cyro} {\cyrr}{\cyra}{\cyrs}{\cyrp}{\cyri}{\cyrs}{\cyra}{\cyrn}{\cyri}{\cyrya} {\cyrd}{\cyrl}{\cyrya} {\cyrd}{\cyrv}{\cyru}{\cyrh} {\cyrr}{\cyra}{\cyrb}{\cyro}{\cyrt}}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {14--20}, publisher = {mathdoc}, number = {1}, year = {1968}, language = {ru}, url = {https://geodesic-test.mathdoc.fr/item/DA_1968_1_a2/} }
N. I. Glebov. Алгоритм составления оптимального расписания для двух работ. Diskretnyj analiz i issledovanie operacij, no. 1 (1968), pp. 14-20. https://geodesic-test.mathdoc.fr/item/DA_1968_1_a2/