Hendrik Schawe

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 that with all known algorithms in the worst case instances are not solveable in polynomial time, i.e., the problem is hard. Though that does not mean, that there are not subsets(More)
  • 1