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., 2009, Issue 11, Pages 148–160 (Mi at562)  

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

Simulation of Behavior and Intelligence

The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal $2$-matching

S. I. Sergeev

Moscow State University of Economics, Statistics and Informatics

Abstract: To solve the symmetric travelling salesman problem we suggest a lower bound – the solution of an optimal $2$-matching problem. The latter problem is solved (in a polynomial number of steps) not completely, but up to obtaining new stable lower bounds.

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

English version:
Automation and Remote Control, 2009, 70:11, 1901–1912

Bibliographic databases:

PACS: 02.30.Yy, 07.05.Dz
Presented by the member of Editorial Board: П. Ю. Чеботарев

Received: 18.06.2009

Citation: S. I. Sergeev, “The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal $2$-matching”, Avtomat. i Telemekh., 2009, no. 11, 148–160; Autom. Remote Control, 70:11 (2009), 1901–1912

Citation in format AMSBIB
\Bibitem{Ser09}
\by S.~I.~Sergeev
\paper The symmetric travelling salesman problem~I. New fast lower bounds for the problem of optimal $2$-matching
\jour Avtomat. i Telemekh.
\yr 2009
\issue 11
\pages 148--160
\mathnet{http://mi.mathnet.ru/at562}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2641279}
\zmath{https://zbmath.org/?q=an:1231.90326}
\transl
\jour Autom. Remote Control
\yr 2009
\vol 70
\issue 11
\pages 1901--1912
\crossref{https://doi.org/10.1134/S0005117909110149}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000271942900014}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-70849110425}


Linking options:
  • http://mi.mathnet.ru/eng/at562
  • http://mi.mathnet.ru/eng/at/y2009/i11/p148

    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
    Cycle of papers

    This publication is cited in the following articles:
    1. S. I. Sergeev, “The symmetric travelling salesman problem II. New low bounds”, Autom. Remote Control, 71:4 (2010), 681–696  mathnet  crossref  mathscinet  zmath  isi
    2. S. I. Sergeev, “Nonlinear resolving functions for the travelling salesman problem”, Autom. Remote Control, 74:6 (2013), 978–994  mathnet  crossref  mathscinet  isi
    3. S. I. Sergeev, “Maximum travelling salesman problem. I”, Autom. Remote Control, 75:12 (2014), 2170–2189  mathnet  crossref  isi
  • Avtomatika i Telemekhanika
    Number of views:
    This page:309
    Full text:101
    References:33
    First page:9

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