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, 1983, Issue 9, Pages 45–50 (Mi at5210)  
This article is cited in 10 scientific papers (total in 10 papers)

Deterministic Systems

Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms

V. A. Bondarenko

Yaroslavl'
Full-text PDF (1086 kB) Citations (10)
Abstract: Effective lowerbounds are proposed of labor consumption for wide ran es of algorithms whereby digital optimization problems of the traveling salesman type are solved.

Received: 14.06.1982
Bibliographic databases:
Document Type: Article
UDC: 519.6
Language: Russian
Citation: V. A. Bondarenko, “Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms”, Avtomat. i Telemekh., 1983, no. 9, 45–50; Autom. Remote Control, 44:9 (1983), 1137–1142
Citation in format AMSBIB
\Bibitem{Bon83}
\by V.~A.~Bondarenko
\paper Nonpolynomial lowerbound of the traveling salesman problem complexity in one class of algorithms
\jour Avtomat. i Telemekh.
\yr 1983
\issue 9
\pages 45--50
\mathnet{http://mi.mathnet.ru/at5210}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=738685}
\zmath{https://zbmath.org/?q=an:0571.90089}
\transl
\jour Autom. Remote Control
\yr 1983
\vol 44
\issue 9
\pages 1137--1142
Linking options:
  • https://www.mathnet.ru/eng/at5210
  • https://www.mathnet.ru/eng/at/y1983/i9/p45
    • This publication is cited in the following 10 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, 2025