CIVILICA We Respect the Science
(ناشر تخصصی کنفرانسهای کشور / شماره مجوز انتشارات از وزارت فرهنگ و ارشاد اسلامی: ۸۹۷۱)

The balanced p-maxian problem on a tree

عنوان مقاله: The balanced p-maxian problem on a tree
شناسه ملی مقاله: ICIORS12_036
منتشر شده در دوازدهمین کنفرانس بین المللی انجمن ایرانی تحقیق در عملیات در سال 1398
مشخصات نویسندگان مقاله:

Jafar Fathali - Faculty of Mathematical Sciences, Shahrood University of Technology, University Blvd., Shahrood, Iran
Mehdi Zaferanieh - Department of Mathematics, Hakim Sabzevari University, Tovhid town, Sabzevar, Iran,

خلاصه مقاله:
In this paper we consider the balanced p-maxian problem on a tree graph. In this problem two objective function are considered. The first one is the traditional p-maxian problem and the second one is minimizing the maximum demand that allocated to any facility. In the case p=2, we show that the optimal solution is two end vertices of the diameter of the tree. Based on this property an ?O(??n2) algorithm is presented to solve the balanced 2-maxian problem.

کلمات کلیدی:
P-maxian Problem, Balanced Allocation, Facility Location

صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/923495/