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!"
Felix, one of my early career doctoral students, recently spoke out the undeniable truth: Reading a paper is much easier than writing one. He implicitly (and later explicitly) asked for advise on how to write a research article to be published in a scientific journal. Felix met the most important criterion already: he had something […]Read more "How to write a paper"
When I was applying for jobs, that is, faculty positions at universities, the search committees asked a lot of questions; about my research plans, teaching concepts, collaboration opportunities, about third party funding and my willingness to take on administrative duties. Besides this information gathering, I was also asked “more challenging” questions. One of them was […]Read more "Where are we heading?"