B. The traveling salesman is a classic example of a constrained optimization problem, where the goal is to find the shortest route passing through all given cities exactly once (subject to the constraints that you must visit each city and return to the start).
upvoted 1 times
...
This section is not available anymore. Please use the main Exam Page.DY0-001 Exam Questions
Log in to ExamTopics
Sign in:
Community vote distribution
A (35%)
C (25%)
B (20%)
Other
Most Voted
A voting comment increases the vote count for the chosen answer by one.
Upvoting a comment with a selected answer will also increase the vote count towards that answer by one.
So if you see a comment that you already agree with, you can upvote it instead of posting a new comment.
SuntzuLegacy
1 month, 1 week ago