Transforming asymmetric into symmetric traveling salesman problems: Erratum
type: Item
instance of: scholarly article
title: Transforming asymmetric into symmetric traveling salesman problems: Erratum
zbMATH Open document ID: 0604.90132
DOI: 10.1016/0167-6377(86)90081-7
author: Ton Volgenant
author: Roy Jonker
published in: Operations Research Letters
publication date: 1986-01-01T00:00:00Z
review text: Our previously presented transformation of partly asymmetric into symmetric traveling salesman problems [see ibid. 2, 161-163 (1983; Zbl 0529.90090)] is shown to be incorrect. It only yields a lower bound on the optimal cost. We also show that asymmetric traveling salesman problems on n nodes can be solved as symmetric problems on 2n-1 nodes.
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 3976812
zbMATH Keywords: asymmetric traveling salesman
zbMATH Keywords: symmetric problems
MaRDI profile type: Publication
full work available at URL: 0167-6377(86)90081-7
OpenAlex ID: W1977346877
cites work: Transforming asymmetric into symmetric traveling salesman problems
description: scientific article; zbMATH DE number 3976812