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, Ser. 1, 2002, Volume 9, Issue 4, Pages 23–32 (Mi da182)  
This article is cited in 1 scientific paper (total in 1 paper)

On the asymptotic accuracy of an algorithm for solving the traveling salesman problem for a maximum in a Euclidean space

A. E. Baburin, E. Kh. Gimadi

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (422 kB) Citations (1)
References:
PDF
HTML
Received: 27.08.2002
Bibliographic databases:
UDC: 519.854
Language: Russian
Citation: A. E. Baburin, E. Kh. Gimadi, “On the asymptotic accuracy of an algorithm for solving the traveling salesman problem for a maximum in a Euclidean space”, Diskretn. Anal. Issled. Oper., Ser. 1, 9:4 (2002), 23–32
Citation in format AMSBIB
\Bibitem{BabGim02}
\by A.~E.~Baburin, E.~Kh.~Gimadi
\paper On the asymptotic accuracy of an algorithm for solving the traveling salesman problem for a maximum in a Euclidean space
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2002
\vol 9
\issue 4
\pages 23--32
\mathnet{http://mi.mathnet.ru/da182}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=1985972}
\zmath{https://zbmath.org/?q=an:1033.90096}
Linking options:
  • https://www.mathnet.ru/eng/da182
  • https://www.mathnet.ru/eng/da/v9/s1/i4/p23
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:437
    Full-text PDF :150
    References:53
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024