Imagine a traveller who has a couple of hours to spend in an unfamiliar city, arriving, for instance, at the central train station and having to be at the airport five hours later to catch their outbound flight. They would like to see at least some of the attractions the city has to offer during this time. If we want to recommend suitable venues, we need to address two major aspects. First, the proposed itinerary along certain points of interest (POIs) has to meet the time constraints of the traveller and, secondly, it should be sufficiently interesting and exciting. We are working on an algorithm for computing this kind of itineraries efficiently.