A new approach to solving the ‘Travelling Salesperson Problem’ – one of the most difficult questions in computer science – significantly outperforms current approaches. A notorious theoretical ...