Finding a Hamilton circuit with the shortest distance for a given complete graph is called _______________.
A)the Hamilton process
B)the traveling salesman problem
C)the Fleury's algorithm
D)the optimal marketing problem

Question

Quizplus · Accepted Answer

The problem of finding a Hamilton circuit with the shortest distance for a given complete graph is commonly known as the traveling salesman problem.

Finding a Hamilton Circuit with the Shortest Distance for a Given