This paper uses a realistic problem taken from the telecommunication world as the basis for comparing different combinatorial optimization algorithms. The problem recalls the minimum hitting set problem, and is solved with greedy-like, Darwinism and genetic algorithms. These three paradigms are described and analyzed with emphasis on the Darwinism approach, which is based on the computation of e-nets.
['Patrice Calégari', 'Frédéric Guidec', 'Pierre Kuonen', 'Frank Nielsen']
Combinatorial optimization algorithms for radio network planning