Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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

Diskretnyi Analiz i Issledovanie Operatsii, 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
Full-text PDF (287 kB) Citations (2) English version article
References:
PDF
HTML
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.
Received: 05.11.2009
Revised: 11.02.2010
English version:
Journal of Applied and Industrial Mathematics, 2011, Volume 5, Issue 3, Pages 322–330
DOI: https://doi.org/10.1134/S1990478911030021
Bibliographic databases:
Document Type: Article
UDC: 519.854
Language: Russian
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{https://mathscinet.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:
  • https://www.mathnet.ru/eng/da614
  • https://www.mathnet.ru/eng/da/v17/i4/p3
    • This publication is cited in the following 2 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:345
    Full-text PDF :140
    References:73
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025