کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4652742 | 1632595 | 2010 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Strong Lower Bounds for a Survivable Network Design Problem
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
We consider a generalization of the Prize Collecting Steiner Tree Problem on a graph with special redundancy requirements on a subset of the customer nodes suitable to model a real world problem occurring in the extension of fiber optic communication networks. We strengthen an existing connection-based mixed integer programming formulation involving exponentially many variables using a recent result with respect to the orientability of two-node connected graphs. The linear programming relaxation of this model is then solved by means of column generation. We show that our new model is theoretically stronger than a previously described one and present promising preliminary computational results.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 36, 1 August 2010, Pages 295-302
Journal: Electronic Notes in Discrete Mathematics - Volume 36, 1 August 2010, Pages 295-302