RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find






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


Avtomat. i Telemekh., 2014, Issue 12, Pages 101–124 (Mi at14165)  

This article is cited in 1 scientific paper (total in 1 paper)

System Analysis and Operations Research

Maximum travelling salesman problem. I

S. I. Sergeev

Moscow State University of Economics, Statistics, and Informatics, Moscow, Russia

Abstract: Some estimates for the optimal quality criterion for the maximum travelling salesman problem are known. These estimates are $\sim75$ % for symmetric problems and $\sim57$ % for asymmetric ones. We propose new estimates: more than $\sim(99.0$$99.7)$ % for symmetric problems and more than $\sim(99.0$$99.23)$ % for asymmetric problems. All estimates are obtained by extending the series of problem that occur in the solution of the maximum travelling salesman problem.

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

English version:
Automation and Remote Control, 2014, 75:12, 2170–2189

Bibliographic databases:

Presented by the member of Editorial Board: А. А. Лазарев

Received: 27.03.2013

Citation: S. I. Sergeev, “Maximum travelling salesman problem. I”, Avtomat. i Telemekh., 2014, no. 12, 101–124; Autom. Remote Control, 75:12 (2014), 2170–2189

Citation in format AMSBIB
\Bibitem{Ser14}
\by S.~I.~Sergeev
\paper Maximum travelling salesman problem.~I
\jour Avtomat. i Telemekh.
\yr 2014
\issue 12
\pages 101--124
\mathnet{http://mi.mathnet.ru/at14165}
\transl
\jour Autom. Remote Control
\yr 2014
\vol 75
\issue 12
\pages 2170--2189
\crossref{https://doi.org/10.1134/S0005117914120078}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000346402900007}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84919338012}


Linking options:
  • http://mi.mathnet.ru/eng/at14165
  • http://mi.mathnet.ru/eng/at/y2014/i12/p101

    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. S. I. Sergeev, “Approximate algorithms for the traveling salesman problem. II”, Autom. Remote Control, 76:3 (2015), 472–479  mathnet  crossref  isi  elib  elib
  • Avtomatika i Telemekhanika
    Number of views:
    This page:288
    Full text:84
    References:19
    First page:23

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