کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
478742 | 1446134 | 2010 | 11 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Lagrangean duals and exact solution to the capacitated p-center problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Lagrangean duals and exact solution to the capacitated p-center problem Lagrangean duals and exact solution to the capacitated p-center problem](/preview/png/478742.png)
چکیده انگلیسی
In this work, we address the capacitated p-center problem (CpCP). We study two auxiliary problems, discuss their relation to CpCP, and analyze the lower bounds obtained with two different Lagrangean duals based on each of these auxiliary problems. We also compare two different strategies for solving exactly CpCP, based on binary search and sequential search, respectively. Various data sets from the literature have been used for evaluating the performance of the proposed algorithms.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 201, Issue 1, 16 February 2010, Pages 71–81
Journal: European Journal of Operational Research - Volume 201, Issue 1, 16 February 2010, Pages 71–81
نویسندگان
Maria Albareda-Sambola, Juan A. Díaz, Elena Fernández,