RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


Diskretn. Anal. Issled. Oper., 2010, Volume 17, Issue 4, Pages 3–17 (Mi da614)  

This article is cited in 2 scientific papers (total in 2 papers)

A fully polynomial randomized approximation scheme based on an evolutionary algorithm

A. V. Eremeev

Omsk Branch of S. L. Sobolev Institute of Mathematics, SB RAS, Omsk, Russia

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.

Full text: PDF file (287 kB)
References: PDF file   HTML file

English version:
Journal of Applied and Industrial Mathematics, 2011, 5:3, 322–330

Bibliographic databases:

UDC: 519.854
Received: 05.11.2009
Revised: 11.02.2010

Citation: A. V. Eremeev, “A fully polynomial randomized approximation scheme based on an evolutionary algorithm”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 3–17; J. Appl. Industr. Math., 5:3 (2011), 322–330

Citation in format AMSBIB
\Bibitem{Ere10}
\by A.~V.~Eremeev
\paper A fully polynomial randomized approximation scheme based on an evolutionary algorithm
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 4
\pages 3--17
\mathnet{http://mi.mathnet.ru/da614}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2779080}
\zmath{https://zbmath.org/?q=an:1249.90331}
\transl
\jour J. Appl. Industr. Math.
\yr 2011
\vol 5
\issue 3
\pages 322--330
\crossref{https://doi.org/10.1134/S1990478911030021}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051954263}


Linking options:
  • http://mi.mathnet.ru/eng/da614
  • http://mi.mathnet.ru/eng/da/v17/i4/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Doerr B., Eremeev A., Neumann F., Theile M., Thyssen Ch., “Evolutionary algorithms and dynamic programming”, Theoret. Comput. Sci., 412:43 (2011), 6020–6035  crossref  mathscinet  zmath  isi  elib  scopus
    2. Panicker Sh., Kumar T.V.V., “Distributed Query Plan Generation Using Multiobjective Genetic Algorithm”, Sci. World J., 2014, 628471  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:200
    Full text:58
    References:20
    First page:3

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021