Minimum power multicasting problem in wireless networks

Valeria Leggieri*, Paolo Nobili, Chefi Triki

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

15 Citations (Scopus)


In this paper we deal with the minimum power multicasting (MPM) problem in wireless ad-hoc networks. By using an appropriate choice of the decision variables and by exploiting the topological properties of the problem, we are able to define an original formulation based on a Set Covering model. Moreover, we propose for its solution two exact procedures that include a preprocessing technique that reduces the huge number of the model's constraints. We also report some experimental results carried out on a set of randomly generated test problems.

Original languageEnglish
Pages (from-to)295-311
Number of pages17
JournalMathematical Methods of Operations Research
Issue number2
Publication statusPublished - Oct 2008
Externally publishedYes


  • Multicast problem
  • Set Covering problem

ASJC Scopus subject areas

  • Software
  • General Mathematics
  • Management Science and Operations Research


Dive into the research topics of 'Minimum power multicasting problem in wireless networks'. Together they form a unique fingerprint.

Cite this