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?
I am a well known supporter (a.k.a. “fan”) of exact optimization. Still, I spent the whole 90 minutes master level class in operations research on heuristics this week (also last week, actually). And I think this is exactly right so. Here is why. Last week we were discussing heuristic methods for solving specific optimization problems. […]Read More Know your Heuristics!