The Traveling Salesman Problem is an example of:
A) visiting stops in order
B) rearranging the order of stops
C) visiting stops in order but allowing the first and last stop to be rearranged
D) rearranging all but the first and last stops of a network

Question

Quizplus · Accepted Answer

The Traveling Salesman Problem involves finding the shortest possible route that visits each city exactly once and returns to the origin city, which inherently involves rearranging the order of stops to achieve the shortest path.

The Traveling Salesman Problem Is an Example Of