120 citations · 268 across the 16 of their papers we have counts for
1 paper · 2 filters
Ulrich Pferschy, Rostislav Stanek
The traveling salesman problem (TSP) is one of the most prominent combinatorial optimization problems. Given a complete graph G = (V, E) and non-negative distances d for every edge…