Upravliaemie systemy
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

Upravliaemie systemy, 1989, Issue 29, Pages 11–15 (Mi da979)  
The traveling salesman problem on a maximum: conditions for the asymptotic accuracy of the algorithm “go to the most remote city”

E. Kh. Gimadi
Full-text PDF (172 kB)
Received: 18.07.1989
Bibliographic databases:
Document Type: Article
UDC: 519.854
Language: Russian
Citation: E. Kh. Gimadi, “The traveling salesman problem on a maximum: conditions for the asymptotic accuracy of the algorithm “go to the most remote city””, Upravliaemie systemy, 1989, no. 29, 11–15
Citation in format AMSBIB
\Bibitem{Gim89}
\by E.~Kh.~Gimadi
\paper The traveling salesman problem on a maximum: conditions for the asymptotic accuracy of the algorithm ``go to the most remote city''
\jour Upravliaemie systemy
\yr 1989
\issue 29
\pages 11--15
\mathnet{http://mi.mathnet.ru/da979}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1110575}
Linking options:
  • https://www.mathnet.ru/eng/da979
  • https://www.mathnet.ru/eng/da/y1989/i29/p11
    • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Diskretnyi Analiz i Issledovanie Operatsii
    Statistics & downloads:
    Abstract page:136
    Full-text PDF :42
    References:5
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025