TSP heuristics: domination analysis and complexity
type: Item
instance of: scholarly article
title: TSP heuristics: domination analysis and complexity
zbMATH Open document ID: 1060.90075
published in: Algorithmica
publication date: 2003-06-02T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1922433
zbMATH Keywords: Domination analysis
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Traveling salesman problem
zbMATH Keywords: Computational complexity
author: Abraham P. Punnen
author: François Margot
author: Santosh N. Kabadi
MaRDI profile type: Publication
full work available at URL: s00453-002-0986-1
OpenAlex ID: W1601856531
DOI: 10.1007/S00453-002-0986-1
description: scientific article; zbMATH DE number 1922433