Itinerant Salesman

I've just come across a great looking book on the Traveling Salesman Problem (TSP) titled 'The Traveling Salesman Problem:A Computational Study' by David L. Applegate, Robert E. Bixby, Vasek Chvátal & William J. Cook - http://www.tsp.gatech.edu/book/index.html. This is a fantastic problem for introducing many mathematical concepts in discrete maths, computational geometry, combinatorics, theory of complexity, heuristics and approximation algorithms, and of course graph theory. Not only is it an interesting launching pad for many topics in math, but it also appears in a number of applications spanning several disciplines. Prehaps we can use some of this theory in our hunt for the Snark .. (and maybe the TSP is a Snark itself).