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., 1994, Issue 6, Pages 106–114 (Mi at3925)  

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

Developing Systems

Computational algorithms for solving the traveling salesman problem. II. A new lower bound

S. I. Sergeev

Moscow institute of Economics and Statistics

Full text: PDF file (1086 kB)

English version:
Automation and Remote Control, 1994, 55:6, 861–868

Bibliographic databases:
UDC: 519.854.2
MSC: Primary 90C27; Secondary 68Q25, 90C10

Received: 14.09.1993

Citation: S. I. Sergeev, “Computational algorithms for solving the traveling salesman problem. II. A new lower bound”, Avtomat. i Telemekh., 1994, no. 6, 106–114; Autom. Remote Control, 55:6 (1994), 861–868

Citation in format AMSBIB
\Bibitem{Ser94}
\by S.~I.~Sergeev
\paper Computational algorithms for solving the traveling salesman problem. II.~A new lower bound
\jour Avtomat. i Telemekh.
\yr 1994
\issue 6
\pages 106--114
\mathnet{http://mi.mathnet.ru/at3925}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1288825}
\zmath{https://zbmath.org/?q=an:0858.90131}
\transl
\jour Autom. Remote Control
\yr 1994
\vol 55
\issue 6
\pages 861--868


Linking options:
  • http://mi.mathnet.ru/eng/at3925
  • http://mi.mathnet.ru/eng/at/y1994/i6/p106

    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 three-dimensional assignment and partition problems. New lower bounds”, Autom. Remote Control, 67:2 (2006), 242–250  mathnet  crossref  mathscinet  zmath
    2. S. I. Sergeev, “Discrete optimization by optimal control methods. I. Separable problems”, Autom. Remote Control, 67:4 (2006), 552–561  mathnet  crossref  mathscinet  zmath
    3. S. I. Sergeev, “Discrete optimization by optimal control methods. II. The static traveling salesman problem”, Autom. Remote Control, 67:6 (2006), 927–932  mathnet  crossref  mathscinet  zmath
    4. S. I. Sergeev, “Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem”, Autom. Remote Control, 67:7 (2006), 1039–1050  mathnet  crossref  mathscinet  zmath
    5. S. I. Sergeev, “Hybrid control systems and the dynamic traveling salesman problem”, Autom. Remote Control, 69:1 (2008), 42–51  mathnet  crossref  mathscinet  zmath  isi
    6. S. I. Sergeev, “New lower bounds for the triplanar assignment problem. Use of the classical model”, Autom. Remote Control, 69:12 (2008), 2039–2060  mathnet  crossref  mathscinet  zmath  isi
    7. S. I. Sergeev, “The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal $2$-matching”, Autom. Remote Control, 70:11 (2009), 1901–1912  mathnet  crossref  mathscinet  zmath  isi
    8. S. I. Sergeev, “Maximum travelling salesman problem. I”, Autom. Remote Control, 75:12 (2014), 2170–2189  mathnet  crossref  isi
    9. 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:120
    Full text:44
    First page:2

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