کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
476017 699411 2008 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The minimum weighted covering location problem with distance constraints
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
The minimum weighted covering location problem with distance constraints
چکیده انگلیسی

The objective is to locate undesirable facilities on a network so as to minimize the total demand covered subject to the condition that no two facilities are allowed to be closer than a pre-specified distance. We prove that there exists a dominating location set and that it is a challenging problem to determine the consistency of the distance constraints. We compare several different mathematical formulations to solve the problem. Heuristics with computational experiments are provided.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 35, Issue 2, February 2008, Pages 356–372
نویسندگان
, ,