comp sci shitpost
computer scientist's girlfriends: come over
comp scientist: i can't, there are so many of you and i have no way of finding out the route between your houses that requires travelling the least distance while visiting each of you once and then returning to my house
girlfriends: our parents aren't home
The travelling salesman problem (TSP) [...] is one of the most intensively studied problems in optimization. It is used as a benchmark for many optimization methods. Even though the problem is computationally difficult, a large number of heuristics and exact algorithms are known, so that some instances with tens of thousands of cities can be solved completely and even problems with millions of cities can be approximated within a small fraction of 1%.
@email@example.com's anti-chud pro-skub instance for funtimes