🎴 Flashcard Mode
Traveling Salesman Problem Algorithms
Card1 / 15
Mastered0
Review0
QuestionClick to flip
Which of the following is a heuristic algorithm for solving TSP?
AnswerClick to flip back
A
Nearest Neighbor
💡 Explanation:
Nearest Neighbor is a simple heuristic algorithm that starts from a random city and visits the nearest unvisited city at each step.