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., 1981, Issue 4, Pages 103–112 (Mi at5767)  

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

Developing Systems

Computing algorithms for solution of some linear and linear integer programming problems. IV

V. F. Krotov, S. I. Sergeev

Moscow

Abstract: An accurate algorithm for solution of the traveling salesman problem is described which employs a method for improving a certain lower bound of the initial functions, the $l$-functional, developed in [1].

Full text: PDF file (1751 kB)

English version:
Automation and Remote Control, 1981, 42:4, 494–501

Bibliographic databases:
UDC: 65.505:519.82

Received: 18.02.1980

Citation: V. F. Krotov, S. I. Sergeev, “Computing algorithms for solution of some linear and linear integer programming problems. IV”, Avtomat. i Telemekh., 1981, no. 4, 103–112; Autom. Remote Control, 42:4 (1981), 494–501

Citation in format AMSBIB
\Bibitem{KroSer81}
\by V.~F.~Krotov, S.~I.~Sergeev
\paper Computing algorithms for solution of some linear and linear integer programming problems.~IV
\jour Avtomat. i Telemekh.
\yr 1981
\issue 4
\pages 103--112
\mathnet{http://mi.mathnet.ru/at5767}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=653883}
\zmath{https://zbmath.org/?q=an:0466.65038}
\transl
\jour Autom. Remote Control
\yr 1981
\vol 42
\issue 4
\pages 494--501


Linking options:
  • http://mi.mathnet.ru/eng/at5767
  • http://mi.mathnet.ru/eng/at/y1981/i4/p103

    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, “Algorithms for solving a separable problem of discrete optimization”, U.S.S.R. Comput. Math. Math. Phys., 30:4 (1990), 218–219  mathnet  crossref  zmath
    2. 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
    3. S. I. Sergeev, “Discrete optimization by optimal control methods. I. Separable problems”, Autom. Remote Control, 67:4 (2006), 552–561  mathnet  crossref  mathscinet  zmath
    4. 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
    5. 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
    6. S. I. Sergeev, “Algorithms to solve some problems of concave programming with linear constraints”, Autom. Remote Control, 68:3 (2007), 399–412  mathnet  crossref  mathscinet  zmath
    7. 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
    8. 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
    9. 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
    10. 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
    11. S. I. Sergeev, “Nonlinear resolving functions for the travelling salesman problem”, Autom. Remote Control, 74:6 (2013), 978–994  mathnet  crossref  mathscinet  isi
    12. S. I. Sergeev, “Maximum travelling salesman problem. I”, Autom. Remote Control, 75:12 (2014), 2170–2189  mathnet  crossref  isi
    13. 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:78
    Full text:33
    First page:2

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