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., 1995, Issue 7, Pages 144–150 (Mi at3684)  

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

Developing Systems

Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming

S. I. Sergeev

Moscow institute of Economics and Statistics

Full text: PDF file (863 kB)

English version:
Automation and Remote Control, 1995, 56:7, 1027–1032

Bibliographic databases:
UDC: 519.854.2

Received: 10.10.1994

Citation: S. I. Sergeev, “Algorithms for the minimax problem of the traveling salesman. I. An approach based on dynamic programming”, Avtomat. i Telemekh., 1995, no. 7, 144–150; Autom. Remote Control, 56:7 (1995), 1027–1032

Citation in format AMSBIB
\Bibitem{Ser95}
\by S.~I.~Sergeev
\paper Algorithms for the minimax problem of the traveling salesman. I.~An approach based on dynamic programming
\jour Avtomat. i Telemekh.
\yr 1995
\issue 7
\pages 144--150
\mathnet{http://mi.mathnet.ru/at3684}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1350634}
\zmath{https://zbmath.org/?q=an:0917.90252}
\transl
\jour Autom. Remote Control
\yr 1995
\vol 56
\issue 7
\pages 1027--1032


Linking options:
  • http://mi.mathnet.ru/eng/at3684
  • http://mi.mathnet.ru/eng/at/y1995/i7/p144

    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, “Discrete optimization by optimal control methods. III. The dynamic traveling salesman problem”, Autom. Remote Control, 67:7 (2006), 1039–1050  mathnet  crossref  mathscinet  zmath
    2. Salii Ya.V., Chentsov A.G., “Ob odnoi marshrutnoi zadache na uzkie mesta s vnutrennimi rabotami”, Vestnik tambovskogo universiteta. seriya: estestvennye i tekhnicheskie nauki, 17:3 (2012), 827–847  elib
    3. A. G. Chentsov, “Bellmanovskie vstavki v zadache marshrutizatsii s ogranicheniyami i uslozhnennymi funktsiyami stoimosti”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2014, no. 4, 122–141  mathnet
    4. A. G. Chentsov, Ya. V. Salii, “A model of “nonadditive” routing problem where the costs depend on the set of pending tasks”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 8:1 (2015), 24–45  mathnet  crossref  elib
    5. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Dinamicheskoe programmirovanie v obobschennoi zadache «na uzkie mesta» i optimizatsiya tochki starta”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 28:3 (2018), 348–363  mathnet  crossref  elib
    6. Salii Ya., “Revisiting Dynamic Programming For Precedence-Constrained Traveling Salesman Problem and Its Time-Dependent Generalization”, Eur. J. Oper. Res., 272:1 (2019), 32–42  crossref  mathscinet  zmath  isi  scopus
  • Avtomatika i Telemekhanika
    Number of views:
    This page:199
    Full text:86
    First page:2

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