On the Tours of a Traveling Salesman

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1969 English Publisher:Society for Industrial & Applied Mathematics (SIAM)Journal:SIAM Journal on Control, volume 7, pages 122-131 (issn: 0036-1402,

Copyright policy )

Authors: Murty, Katta G.;

doi: 10.1137/0307009

On the Tours of a Traveling Salesman

- Summary
- Subjects
- Metrics

Abstract

Adjacency properties of tours on their convex hull are discussed. A rule is given by which it can be tested whether any two tours are adjacent vertices on this convex hull or not. Based on this rule an algorithm is described for generating all the adjacent tours of a given tour.

Keywords

Combinatorial optimization, traveling salesman, Programming involving graphs or networks

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	14
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average