کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
10523957 957152 2013 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A minmax regret median problem on a tree under uncertain locations of the demand points
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
A minmax regret median problem on a tree under uncertain locations of the demand points
چکیده انگلیسی
This paper deals with the location of a new facility on a tree according to the minimization of the weighted distance to the customers. The weights represent demands of the set of nodes. The exact location of each customer will be assumed unknown but close to its corresponding node. In this context, an algorithm to find a minmax regret median is proposed and its complexity is shown to be O(nlog(n)), where n is the number of nodes of the tree
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Operations Research Letters - Volume 41, Issue 6, November 2013, Pages 602-606
نویسندگان
,