{"version":"1.0","type":"link","title":"Nearest neighbour algorithm - Newikis","description":"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…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400}