کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
474297 698860 2006 17 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
On the capacitated concentrator location problem: a reformulation by discretization
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
On the capacitated concentrator location problem: a reformulation by discretization
چکیده انگلیسی

In this paper, we present and discuss a discretized model for the two versions of the capacitated concentrator location problem: a simple version (SCCLP) and a version with modular capacities (MCCLP). We show that the linear programming relaxation of the discretized model is at least as good as the linear programming relaxation of conventional models for the two variations of the problem under study. A technique for deriving valid inequalities from the equations of the discretized model is also given. We will show that this technique provides inequalities that significantly enhance the linear programming bound of the discretized model. Our computational results show the advantage of the new models for obtaining the optimal integer solution for the two versions of the problem.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 33, Issue 5, May 2006, Pages 1242–1258
نویسندگان
, ,