bn:02476817n
Noun Concept
Categories: Computational problems in graph theory, long volume value, NP-complete problems, Graph algorithms, NP-hard problems
EN
travelling salesman problem  travelling salesperson problem  TSP problem  traveling salesman problem  Computational complexity of the travelling salesman problem
EN
The travelling salesman problem asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" Wikipedia
Definitions
Relations
Sources
EN
The travelling salesman problem asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?" Wikipedia
Optimization problem Wikipedia Disambiguation
NP-hard problem in combinatorial optimization Wikidata
The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city. Wiktionary
Mathematical problem. Wiktionary (translation)