کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10524049 957190 2005 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
چکیده انگلیسی
We study a two-phase, budget-constrained, network-planning problem with multiple hub types and demand scenarios. In each phase, we install (or move) capacitated hubs on selected buildings. We allocate hubs to realized demands, under technological constraints. We present a greedy algorithm to maximize expected demand covered and computationally study its performance.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 33, Issue 2, March 2005, Pages 134-142
نویسندگان
, , , ,