RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Subscription

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


Diskretn. Anal. Issled. Oper., 2010, Volume 17, Issue 4, Pages 84–91 (Mi da619)  

This article is cited in 2 scientific papers (total in 2 papers)

An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a finite-dimensional normed space

V. V. Shenmaier

S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia

Abstract: The algorithm generalizes the well-known A. Serdyukov's algorithm for the euclidean MAX TSP. The algorithm is asymptotically exact in the case of an arbitrary finite-dimensional normed space. Ill. 4, bibliogr. 6.

Keywords: MAX TSP, geometric traveling salesman problem, finite-dimensional normed space, asymptotically exact algorithm.

Full text: PDF file (252 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.176
Received: 28.12.2009
Revised: 06.03.2010

Citation: V. V. Shenmaier, “An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a finite-dimensional normed space”, Diskretn. Anal. Issled. Oper., 17:4 (2010), 84–91

Citation in format AMSBIB
\Bibitem{She10}
\by V.~V.~Shenmaier
\paper An asymptotically exact algorithm for the maximum-weight traveling salesman problem in a~finite-dimensional normed space
\jour Diskretn. Anal. Issled. Oper.
\yr 2010
\vol 17
\issue 4
\pages 84--91
\mathnet{http://mi.mathnet.ru/da619}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2779085}
\zmath{https://zbmath.org/?q=an:1249.90224}


Linking options:
  • http://mi.mathnet.ru/eng/da619
  • http://mi.mathnet.ru/eng/da/v17/i4/p84

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. Tapanyo W., Jaipong P., “Maximal Buttonings of Non-Tree Graphs”, Thai J. Math., 15:3 (2017), 733–745  mathscinet  isi
    2. V. V. Shenmaier, “Algoritm dlya poliedralnoi zadachi o tsiklovom pokrytii s ogranicheniyami na kolichestvo i dlinu tsiklov”, Tr. IMM UrO RAN, 24, no. 3, 2018, 272–280  mathnet  crossref  elib
  • ƒискретный анализ и исследование операций
    Number of views:
    This page:355
    Full text:105
    References:29
    First page:6

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021