Nearest neighbour algorithm
Used to determine solution to travelling salesman problem
The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem approximately. In that problem, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited.
Nº Q1374523 ★
Common · Knowledge
Nearest neighbour algorithm
Used to determine solution to travelling salesman problem
The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem approximately. In that problem, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited.
From Wikipedia
The nearest neighbour algorithm was one of the first algorithms used to solve the travelling salesman problem approximately. In that problem, the salesman starts at a random city and repeatedly visits the nearest city until all have been visited. The algorithm quickly yields a short tour, but usually not the optimal one.
Text: Wikipédia, CC BY-SA 4.0. · Image: Saurabh.harsh (CC BY-SA 3.0) ·
Related cards
-
K
K-nearest neighbors algorithm
Classification algorithm
Nº Q1071612 ★★
Not listed
-
Las Vegas algorithm
Randomized algorithm guaranteed to eventually produce correct or optimal results
Nº Q1241487 ★
Not listed
-
Shortest path problem
Problem of finding a path between two vertices (or nodes) in a graph such that the sum of the weights of its constituent edges is minimized
Nº Q1058754 ★★
Not listed
-
Kruskal's algorithm
Minimum spanning forest algorithm that greedily adds edges
Nº Q797860 ★★
Not listed
-
P
Peterson's algorithm
Concurrent programming algorithm for mutual exclusion
Nº Q903721 ★
Not listed
-
Painter's algorithm
Graphics algorithm in which polygons in a scene are sorted by depth and painted in this order, farthest to closest
Nº Q936719 ★
Not listed