Several 'tubechallenges' have been attempted on the London Underground network, often gaining vast press coverage. The most famous of them consists of trying to travel to all 275 stations of the London Underground network (known as 'the tube') in the shortest possible time. In this article we examine how Operational Research can assist potential record-breakers, by formulating this complex optimisation problem as an integer programming model and trying to establish the optimal route that one has to follow, taking into consideration as many route constraints as possible.