Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
Efficient lower bounds for the complexity are proposed for a wide range of algorithms of solution of discrete optimization problems of the traveling salesman type.
scientific article; zbMATH DE number 3912134