Volume 17, No 4, 2010, P. 3-17
UDC 519.854
A. V. Eremeev
A fully polynomial randomized approximation scheme based on an evolutionary algorithm
Abstract:
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.
Eremeev Anton Valentinovich 1
1. Omsk Branch of S. L. Sobolev Institute of Mathematics, SB RAS,
13 Pevtsov str., 644099 Omsk, Russia
e-mail: eremeev@ofim.oscsbras.ru
