Trudy Instituta Matematiki i Mekhaniki UrO RAN
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find




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

Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2008, Volume 14, Number 2, Pages 23–32 (Mi timm21)  
This article is cited in 11 scientific papers (total in 11 papers)

Mathematical Programming

Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space

E. Kh. Gimadi
Full-text PDF (311 kB) Citations (11)
References:
PDF
HTML
Abstract: The paper presents a polynomial approximation algorithm $\mathcal A$ solving the problem of finding one and two edge-disjoint Hamiltonian cycles (traveling salesman routes) of maximal weight in a complete weighted undirected graph in multidimensional Euclidean space. The asymptotic optimality of the algorithm is established.
Received: 18.02.2008
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2008, Volume 263, Issue 2, Pages S57–S67
DOI: https://doi.org/10.1134/S0081543808060072
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: E. Kh. Gimadi, “Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space”, Trudy Inst. Mat. i Mekh. UrO RAN, 14, no. 2, 2008, 23–32; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S57–S67
Citation in format AMSBIB
\Bibitem{Gim08}
\by E.~Kh.~Gimadi
\paper Asymptotically optimal algorithm for finding one and two edge-disjoint traveling salesman routes of maximal weight in Euclidean space
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2008
\vol 14
\issue 2
\pages 23--32
\mathnet{http://mi.mathnet.ru/timm21}
\zmath{https://zbmath.org/?q=an:1178.90335}
\elib{https://elibrary.ru/item.asp?id=11929726}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2008
\vol 263
\issue , suppl. 2
\pages S57--S67
\crossref{https://doi.org/10.1134/S0081543808060072}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000208363700006}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-60949091233}
Linking options:
  • https://www.mathnet.ru/eng/timm21
  • https://www.mathnet.ru/eng/timm/v14/i2/p23
    • This publication is cited in the following 11 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:410
    Full-text PDF :103
    References:68
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024