کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
482503 | 1446143 | 2009 | 4 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
A polynomial solvable minimum risk spanning tree problem with interval data
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
علوم کامپیوتر (عمومی)
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: A polynomial solvable minimum risk spanning tree problem with interval data A polynomial solvable minimum risk spanning tree problem with interval data](/preview/png/482503.png)
چکیده انگلیسی
We propose and study a new model for the spanning tree problem with interval data, the Minimum Risk Spanning Tree (MRST) problem, that finds diverse applications in network design. Given an underlying network G=(V,E)G=(V,E), each link e∈Ee∈E can be established by paying a cost ce∈[c̲e,c¯e], and accordingly takes a risk c¯e-cec¯e-c̲e of link failure. The MRST problem is to establish a spanning tree T in G of total cost not more than a given constant so that the risk sum over the links in T is minimized. We prove that the MRST problem can be solved in polynomial time, and thus has algorithmic aspect more satisfactory than the NP-hard robust spanning tree problem with interval data.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Operational Research - Volume 198, Issue 1, 1 October 2009, Pages 43–46
Journal: European Journal of Operational Research - Volume 198, Issue 1, 1 October 2009, Pages 43–46
نویسندگان
Xujin Chen, Jie Hu, Xiaodong Hu,