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 ...

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 ...