KnowraTravelling salesman problemLinked fromLinked fromThe 17 pages that link to Travelling salesman problem, each with the reason it gives.All 17Broader topic 8Related 4Narrower topic 1Compared with 4Shortest path problemCompared with: It requires a global visit-and-return tour rather than a route between two vertices.Assignment problemCompared with: It adds a single-tour connectivity requirement absent from ordinary assignment.Hamiltonian path problemCompared with: It adds edge costs and a return requirement to a Hamiltonian-cycle-style search.Gilbert–Pollak conjectureCompared with: Unlike Steiner trees, tours must visit terminals in a cycle and cannot exploit free junctions.