What is the common name of the computational problem whose task, when given a list of cities and the distances between them is to find the shortest possible tour that visits each city once?
Generalized travelling salesman problem Salesman problem Euclidian TSP Traveling tourist problem Traveling salesman problem Travelling salesperson problem Euclidean TSP TSP Problem Travelling Salesman Problem Salesman Problem Traveling salesperson problem Metric traveling salesman Metric TSP Euclidean traveling salesman Traveling Salesman problem Euclidean travelling salesman Travelling salesmen problem Euclidean travelling salesman problem Delta travelling salesman problem Metric tsp Traveling Salesman Problem Tsp problem Travelling salesman problem TSP problem Wandering salesman problem Travelling-salesman problem Generalized traveling salesman problem Traveling salesman puzzle Willy Loman problem Traveling salesmen problem Euclidean traveling salesman problem Travelling Salesman problem Salesperson Problem
traveling tourist problem wandering salesman problem travelling salesperson problem metric traveling salesman willy loman problem traveling salesmen problem traveling salesperson problem metric tsp euclidean traveling salesman problem traveling salesman problem tsp problem euclidean traveling salesman travelling salesmen problem euclidian tsp euclidean travelling salesman travelling salesman problem generalized traveling salesman problem euclidean travelling salesman problem euclidean tsp traveling salesman puzzle generalized travelling salesman problem salesman problem delta travelling salesman problem salesperson problem
travelling salesman problem
WikipediaEntity
Travelling salesman problem