Given a graph whose arc traversal times vary over time, the time-dependent travelling salesman problem (TDTSP) consists in finding a Hamiltonian tour of least total duration covering the vertices of ...

Every day, humans type out more than 200 billion emails, hundreds of millions of tweets, and innumerable texts, chats, and private messages. No one person could pick through even a tiny sliver of this ...

This is a preview. Log in through your library . Abstract This paper presents the Levinson algorithm, its rediscoveries and extensions. A review is given of the applications of the procedure to ...