AG 1, AG 3, AG 5, SWS, AG 4, RG1, MMCI   Info

Public Audience

English

60 Minutes

Saarbrücken

Randomized search heuristics are solution strategies that can be applied to a wide range of problems. They can be easily implemented, adapted, and reused. As a major advantage, search heuristics require only a minimal amount of knowledge on the given problem. Conversely, it is often difficult to give theoretical performance guarantees for randomized search heuristics.

We address this problem from two perspectives. The first perspective is algorithmic. We ask, which problems a specific search heuristic can solve efficiently. The second perspective is combinatorial. Here, we investigate the properties of random problem instances.

Daniel Johannsen

--email hidden

passcode not visible

logged in users only