Geodesic
A solution of a discrete programming problem by the method of constructing a sequence of plans
Doklady Akademii Nauk, Tome 188 (1969) no. 2, pp. 272-273 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DAN_1969_188_2_a3,
     author = {V. A. Emelichev and V. I. Komlik},
     title = {A solution of a discrete programming problem by the method of constructing a sequence of plans},
     journal = {Doklady Akademii Nauk},
     pages = {272--273},
     year = {1969},
     volume = {188},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1969_188_2_a3/}
}
TY  - JOUR
AU  - V. A. Emelichev
AU  - V. I. Komlik
TI  - A solution of a discrete programming problem by the method of constructing a sequence of plans
JO  - Doklady Akademii Nauk
PY  - 1969
SP  - 272
EP  - 273
VL  - 188
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/DAN_1969_188_2_a3/
LA  - ru
ID  - DAN_1969_188_2_a3
ER  - 
%0 Journal Article
%A V. A. Emelichev
%A V. I. Komlik
%T A solution of a discrete programming problem by the method of constructing a sequence of plans
%J Doklady Akademii Nauk
%D 1969
%P 272-273
%V 188
%N 2
%U http://geodesic.mathdoc.fr/item/DAN_1969_188_2_a3/
%G ru
%F DAN_1969_188_2_a3
V. A. Emelichev; V. I. Komlik. A solution of a discrete programming problem by the method of constructing a sequence of plans. Doklady Akademii Nauk, Tome 188 (1969) no. 2, pp. 272-273. http://geodesic.mathdoc.fr/item/DAN_1969_188_2_a3/