By Joseph De Cleene
This week, we saw in Business Logistics the issue of the Travelling Salesman Problem. Given a collection of cities connected by highways, TSP helps us to find out what the shortest route that visits every city and returns to the starting place is.
This article claims that a team of researchers in Stanford and McGill universities broke a 35-year record in computer science by an almost imperceptible margin. This advance was too minuscule to have any immediate practical significance but it did breathe new life into the search for improved approximate solutions.