12 citations · 13 across the 3 of their papers we have counts for
1 paper · 2 filters
Sabrina C. L. Ammann, Birte Ostermann, Sebastian Stiller +1
The Traveling Salesman Problem (TSP) is one of the most extensively researched and widely applied combinatorial optimization problems. It is NP-hard even in the symmetric and metri…