Answers are grounded in this paper and cite their sources.
The travelling salesman problem arises in many different contexts.In this paper we report on typical applications in computer wiring, vehicle routing, clustering ancl job-shop scheduling.We show that the formulation as a travelling salesman problem is essentially the simplest wa;y to solve these problems by establishing complete equivalence.Most applications originated from real world problems and thus seem to be of particular interest.Illustrated examples are provided with each application.
No takes yet. Share an insight, caveat, or question.
Lenstra et al. (1975) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: