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 4Complete graphRelated: Its standard graph model connects every city pair, often with weighted complete graphs.Path (graph theory)Related: Its tours are closed routes closely related to Hamiltonian cycles and paths.Hamiltonian cycleRelated: Its tours are Hamiltonian cycles in weighted graphs, with cost added as an objective.Hamiltonian pathRelated: Its tours are Hamiltonian cycles with edge costs and an optimization objective.