Combinatorial optimisation is a fundamental field in applied mathematics and computer science that focuses on finding an optimal object from a finite set of objects. In this context, problems are ...
We present a probabilistic greedy search method for combinatorial optimisation problems. This approach is implemented and evaluated for the Set Covering Problem (SCP) and shown to yield a simple, ...
What are you currently researching? I am mostly interested in combinatorial optimisation under uncertainty. In other words, I consider classical combinatorial optimisation problems and ask myself what ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback