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, 1990, Issue 30, Pages 25–29 (Mi da970)  

Justification of conditions for the asymptotic exactness of an approximate algorithm for solving the traveling salesman problem on a maximum in the case of a discrete distribution

E. Kh. Gimadi, N. K. Maksishko
Received: 01.08.1990
Bibliographic databases:
Document Type: Article
UDC: 519.854
Language: Russian
Citation: E. Kh. Gimadi, N. K. Maksishko, “Justification of conditions for the asymptotic exactness of an approximate algorithm for solving the traveling salesman problem on a maximum in the case of a discrete distribution”, Upravliaemie systemy, 1990, no. 30, 25–29
Citation in format AMSBIB
\Bibitem{GimMak90}
\by E.~Kh.~Gimadi, N.~K.~Maksishko
\paper Justification of conditions for the asymptotic exactness of an approximate algorithm for solving the traveling salesman problem on a maximum in the case of a discrete distribution
\jour Upravliaemie systemy
\yr 1990
\issue 30
\pages 25--29
\mathnet{http://mi.mathnet.ru/da970}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=1174268}
\zmath{https://zbmath.org/?q=an:0814.90120}
Linking options:
  • https://www.mathnet.ru/eng/da970
  • https://www.mathnet.ru/eng/da/y1990/i30/p25
  • 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:146
    Full-text PDF :52
    References:5
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025