The traveling salesman problem seeks to find the shortest path or route that visits each city or location exactly once and returns to the starting location. Hence the right fill-in-the-blank is "Travelling Salesman".
What is a Travelling Salesman Problem?
The travelling salesman problem is an algorithm that seeks the shortest path to visit each city exactly once and return to its starting location. The traveling salesman problem requires a set of cities or locations and the distance between each pair of locations or cities. This algorithm finds the shortest possible route that visits every given location and returns to its starting location. This is an NP-Hard problem.
The correct question is given below:
"
The _________ problem seeks to find the shortest possible route that visits each location or city exactly once and returns to the starting location.
"
You can learn more about travelling salesman problem at
https://brainly.com/question/26913198
#SPJ4
