Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
type: Item
instance of: scholarly article
title: Nonpolynomial lower bounds for the complexity of the traveling salesman problem in a class of algorithms
zbMATH Open document ID: 0571.90089
author: V. A. Bondarenko
published in: Automation and Remote Control
publication date: 1983-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 3912134
zbMATH Keywords: nonpolynomial lower bounds
zbMATH Keywords: computational complexity
zbMATH Keywords: discrete optimization
zbMATH Keywords: traveling salesman
MaRDI profile type: Publication
description: scientific article; zbMATH DE number 3912134