60 citations · 366 across the 26 of their papers we have counts for
1 paper · 1 filter
Hendrik Schawe, Alexander K. Hartmann
The Traveling Salesperson problem asks for the shortest cyclic tour visiting a set of cities given their pairwise distances and belongs to the NP-hard complexity class, which means…