Archive for the ‘tsp’ Category

Some fantastic things as of late. (Not more fantastic than previously but still not bad.) A puzzle. You have an integer array of length N in memory, indexed from 1 to N. Each of the integers that it contains is between 1 and N-1. By the pigeonhole principle, two entries are the same. If the […]

Bill Cook gave a talk at Waterloo about some of his work on the Traveling Salesman Problem (TSP). He has worked in the area for something like two decades. Here are some notes and highlights of his talk. One of his main research interests is the solution of TSPs to optimality. It’s worth pointing out […]