In this third of a trinity of posts involving the travelling salesman problem, we finally use the sophisticated algorithms at our disposal as they were intended: drinking with peak efficiency.
With the aid of a well-placed Christmas present detailing the best pubs in London, I found the optimal route around a reasonable subset of them.
This is the second in a series of posts involving the travelling salesman problem, somehow even more frivolous than the first. This is no coincidence, as I have recently been reading the excellent book ‘In Pursuit of the Travelling Salesman‘, which goes into great detail on the history of the problem and algorithmic techniques for tackling it. The topic which caught my eye was decidedly less technical, as we shall see below.
In the finest traditions of christmas, how about a timely blog post meant to cynically cash in on a blogosphere craving seasonal articles about nothing much in particular (see previous, sadly failed, attempt). What are the implications of Santa flying around the UK in a single night?
Almost looks like work 