Geodesic
A polynomial algorithm for the approximate solution of a problem in scheduling theory
Diskretnyj analiz i issledovanie operacij, no. 28 (1988), pp. 8-11 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{DA_1988_28_a1,
     author = {V. A. Aksenov},
     title = {A polynomial algorithm for the approximate solution of a problem in scheduling theory},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {8--11},
     year = {1988},
     number = {28},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_1988_28_a1/}
}
TY  - JOUR
AU  - V. A. Aksenov
TI  - A polynomial algorithm for the approximate solution of a problem in scheduling theory
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 1988
SP  - 8
EP  - 11
IS  - 28
UR  - http://geodesic.mathdoc.fr/item/DA_1988_28_a1/
LA  - ru
ID  - DA_1988_28_a1
ER  - 
%0 Journal Article
%A V. A. Aksenov
%T A polynomial algorithm for the approximate solution of a problem in scheduling theory
%J Diskretnyj analiz i issledovanie operacij
%D 1988
%P 8-11
%N 28
%U http://geodesic.mathdoc.fr/item/DA_1988_28_a1/
%G ru
%F DA_1988_28_a1
V. A. Aksenov. A polynomial algorithm for the approximate solution of a problem in scheduling theory. Diskretnyj analiz i issledovanie operacij, no. 28 (1988), pp. 8-11. http://geodesic.mathdoc.fr/item/DA_1988_28_a1/