کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
10348332 | 699408 | 2011 | 15 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
MIP models for connected facility location: A theoretical and computational study
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: MIP models for connected facility location: A theoretical and computational study MIP models for connected facility location: A theoretical and computational study](/preview/png/10348332.png)
چکیده انگلیسی
We model ConFL using seven compact and three mixed integer programming formulations of exponential size. We also show how to transform ConFL into the Steiner arborescence problem. A full hierarchy between the models is provided. For two exponential size models we develop a branch-and-cut algorithm. An extensive computational study is based on two benchmark sets of randomly generated instances with up to 1300 nodes and 115,000 edges. We empirically compare the presented models with respect to the quality of obtained bounds and the corresponding running time. We report optimal values for all but 16 instances for which the obtained gaps are below 0.6%.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Computers & Operations Research - Volume 38, Issue 2, February 2011, Pages 435-449
Journal: Computers & Operations Research - Volume 38, Issue 2, February 2011, Pages 435-449
نویسندگان
Stefan Gollowitzer, Ivana LjubiÄ,