Technical Note—Rounding Symmetric Traveling Salesman Problems with an Asymmetric Assignment Problem

R. Jonker, G. De Leve, J. A. Van Der Velde and A. Volgenant
Additional contact information
R. Jonker: Universiteit van Amsterdam, The Netherlands
G. De Leve: Universiteit van Amsterdam, The Netherlands
J. A. Van Der Velde: Universiteit van Amsterdam, The Netherlands
A. Volgenant: Universiteit van Amsterdam, The Netherlands

Operations Research, 1980, vol. 28, issue 3-part-i, 623-627

Abstract: For the distance matrix of symmetric traveling salesman problems a simple transformation into an equivalent asymmetric one is given. Assignment algorithms yield sharper lowerbounds and less subtours from the transformed distance matrix. This implies a better performance for traveling salesman algorithms based on the assignment relaxation.

Date: 1980
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/opre.28.3.623 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:28:y:1980:i:3-part-i:p:623-627

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().