|
|||||
|
|
Some fully polynomial time randomized approximation scheme based on an evolutionary algorithm |
|
| Authors: | A V Eremeev |
| Institution: | 1.Omsk Department of Sobolev Institute of Mathematics,Omsk,Russia |
| Abstract: | Considering the class of discrete optimization problems that satisfy the Woeginger conditions of existence of a fully polynomial-time approximation scheme, we propose a fully polynomial-time randomized approximation scheme based on an evolutionary algorithm. |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |