Geodesic
A fully polynomial randomized approximation scheme based on an evolutionary algorithm
Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 4, pp. 3-17

Voir la notice de l'article provenant de la source Math-Net.Ru

A fully polynomial randomized approximation scheme is proposed on the basis of an evolutionary algorithm for discrete optimization problems satisfying the conditions of existense of fully polynomial randomized approximation schemes due to Woeginger. Bibliogr. 24.
Keywords: evolutionary algorithm, approximation solution, approximation scheme, dynamic programming, randomization. 
@article{DA_2010_17_4_a0,
     author = {A. V. Eremeev},
     title = {A fully polynomial randomized approximation scheme based on an evolutionary algorithm},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {3--17},
     publisher = {mathdoc},
     volume = {17},
     number = {4},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2010_17_4_a0/}
}
TY  - JOUR
AU  - A. V. Eremeev
TI  - A fully polynomial randomized approximation scheme based on an evolutionary algorithm
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2010
SP  - 3
EP  - 17
VL  - 17
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2010_17_4_a0/
LA  - ru
ID  - DA_2010_17_4_a0
ER  - 
%0 Journal Article
%A A. V. Eremeev
%T A fully polynomial randomized approximation scheme based on an evolutionary algorithm
%J Diskretnyj analiz i issledovanie operacij
%D 2010
%P 3-17
%V 17
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2010_17_4_a0/
%G ru
%F DA_2010_17_4_a0
A. V. Eremeev. A fully polynomial randomized approximation scheme based on an evolutionary algorithm. Diskretnyj analiz i issledovanie operacij, Tome 17 (2010) no. 4, pp. 3-17. http://geodesic.mathdoc.fr/item/DA_2010_17_4_a0/