Avtomatika i Telemekhanika
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

Avtomatika i Telemekhanika, 2010, Issue 4, Pages 150–168 (Mi at808)  
This article is cited in 5 scientific papers (total in 5 papers)

Simulation of Behavior and Intelligence

The symmetric travelling salesman problem II. New low bounds

S. I. Sergeev

Moscow State University of Economics, Statistics and Informatics
Full-text PDF (293 kB) Citations (5)
References:
PDF
HTML
Abstract: The branch-and-bound method is adduced for the symmetric salesman problem where two lower bounds are proposed as bounds. The first bound is a solution to the problem of optimal $2$-matching; the second one, to the problem of minimum spanning $1$-tree. The last bound is enhanced by applying the problem of optimal $2$-matching. Both these bounds considerably improve the symmetric traveling salesman problem as compared to the asymmetric problem.
Presented by the member of Editorial Board: A. A. Lazarev

Received: 08.12.2008
English version:
Automation and Remote Control, 2010, Volume 71, Issue 4, Pages 681–696
DOI: https://doi.org/10.1134/S0005117910040090
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: S. I. Sergeev, “The symmetric travelling salesman problem II. New low bounds”, Avtomat. i Telemekh., 2010, no. 4, 150–168; Autom. Remote Control, 71:4 (2010), 681–696
Citation in format AMSBIB
\Bibitem{Ser10}
\by S.~I.~Sergeev
\paper The symmetric travelling salesman problem~II. New low bounds
\jour Avtomat. i Telemekh.
\yr 2010
\issue 4
\pages 150--168
\mathnet{http://mi.mathnet.ru/at808}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2682144}
\zmath{https://zbmath.org/?q=an:1206.90154}
\transl
\jour Autom. Remote Control
\yr 2010
\vol 71
\issue 4
\pages 681--696
\crossref{https://doi.org/10.1134/S0005117910040090}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000276758000009}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-77951735982}
Linking options:
  • https://www.mathnet.ru/eng/at808
  • https://www.mathnet.ru/eng/at/y2010/i4/p150
    Cycle of papers
    This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024