RUS  ENG
Full version
JOURNALS // Avtomatika i Telemekhanika // Archive

Avtomat. i Telemekh., 1994 Issue 6, Pages 106–114 (Mi at3925)

This article is cited 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

UDC: 519.854.2

MSC: Primary 90C27; Secondary 68Q25, 90C10


Received: 14.09.1993


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

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025