Are we too complicated?

In the field of mathematical optimization there is hardly a problem of more fame than the traveling salesperson problem (TSP). Given a number of cities and the distances between them, find a “round-trip” (a tour) that visits every city, returns to the starting point, thereby covering a shortest possible distance. There is a wealth of […]

Read More Are we too complicated?