RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive
Avtomat. i Telemekh., 1983 Issue 9, Pages 45–50 (Mi at5210)
This article is cited in 10 papers

Deterministic Systems

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

V. A. Bondarenko

Yaroslavl'

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.

UDC: 519.6


Received: 14.06.1982


 English version: Automation and Remote Control, 1983, 44:9, 1137–1142

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024