Traveling salesman problem under categorization
type: Item
instance of: scholarly article
title: Traveling salesman problem under categorization
zbMATH Open document ID: 0768.90077
DOI: 10.1016/0167-6377(92)90069-F
author: Abraham P. Punnen
published in: Operations Research Letters
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C60
zbMATH DE Number: 95778
zbMATH Keywords: traveling salesman
zbMATH Keywords: bottleneck traveling salesman
zbMATH Keywords: strongly NP-complete
zbMATH Keywords: Halin graphs
MaRDI profile type: Publication
cites work: Bottleneck assignment problems under categorization
cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees
cites work: Halin graphs and the travelling salesman problem
cites work: The square of every two-connected graph is Hamiltonian
cites work: Q4198056
cites work: The Bottleneck Traveling Salesman Problem
cites work: Group centre and group median of a network
cites work: Minmax linear programmes with grouped variables
cites work: A mofified gub algorithm for solving linear minimax problems
cites work: Q5187226
cites work: Guaranteed performance heuristics for the bottleneck traveling salesman problem
cites work: The traveling salesman problem: An update of research
cites work: Minimum perfect bipartite matchings and spanning trees under categorization
cites work: Some Generalisations of the Time Minimising Assignment Problem
cites work: Steiner problem in Halin networks
full work available at URL: 0167-6377(92)90069-f
OpenAlex ID: W3123213514
description: scientific article; zbMATH DE number 95778