ملخص
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.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 295-311 |
عدد الصفحات | 17 |
دورية | Mathematical Methods of Operations Research |
مستوى الصوت | 68 |
رقم الإصدار | 2 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - أكتوبر 2008 |
منشور خارجيًا | نعم |
ASJC Scopus subject areas
- ???subjectarea.asjc.1700.1712???
- ???subjectarea.asjc.2600.2600???
- ???subjectarea.asjc.1800.1803???