Combinatorial optimization algorithms for radio network planning

  • Calégari P
  • Guidec F
  • Kuonen P
 et al. 
  • 7


    Mendeley users who have this article in their library.
  • N/A


    Citations of this article.


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 epsilon-nets.

Author-supplied keywords

  • combinatorial optimization
  • genetic algorithm
  • radio transceiver siting
  • set system

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • P Calégari

  • F Guidec

  • P Kuonen

  • F Nielsen

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free