کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
481067 | 1446116 | 2010 | 5 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
The capacitated single-allocation hub location problem revisited: A note on a classical formulation
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: The capacitated single-allocation hub location problem revisited: A note on a classical formulation The capacitated single-allocation hub location problem revisited: A note on a classical formulation](/preview/png/481067.png)
چکیده انگلیسی
In this paper a well-known formulation for the capacitated single-allocation hub location problem is revisited. An example is presented showing that for some instances this formulation is incomplete. The reasons for the incompleteness are identified leading to the inclusion of an additional set of constraints. Computational experiments are performed showing that the new constraints also help to decrease the computational time required to solve the problem optimally.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 207, Issue 1, 16 November 2010, Pages 92–96
Journal: European Journal of Operational Research - Volume 207, Issue 1, 16 November 2010, Pages 92–96
نویسندگان
Isabel Correia, Stefan Nickel, Francisco Saldanha-da-Gama,