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

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...

1. Challenges -- Tour of the United States -- An impossible task? -- One problem at a time -- Road map of the book -- 2. Origins of the problem -- Before the mathematicians -- Euler and Hamilton -- ...