KMS Of Academy of mathematics and systems sciences, CAS
A polynomial solvable minimum risk spanning tree problem with interval data | |
Chen, Xujin; Hu, Jie; Hu, Xiaodong | |
2009-10-01 | |
发表期刊 | EUROPEAN JOURNAL OF OPERATIONAL RESEARCH |
ISSN | 0377-2217 |
卷号 | 198期号:1页码:43-46 |
摘要 | 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), each link e is an element of E can be established by paying a Cost c(e) is an element of [(c) under bar (e), (c) over bar (e)], and accordingly takes a risk (c) over bar (e)-c(e)/(c) over bar (e)-(c) under bar (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. (C) 2008 Elsevier B.V. All rights reserved. |
关键词 | Combinatorial optimization Spanning tree Interval data |
DOI | 10.1016/j.ejor.2008.06.039 |
语种 | 英语 |
资助项目 | National Natural Science Foundation of China[70221001] ; National Natural Science Foundation of China[10531070] ; National Natural Science Foundation of China[10771209] ; National Natural Science Foundation of China[10721101] |
WOS研究方向 | Business & Economics ; Operations Research & Management Science |
WOS类目 | Management ; Operations Research & Management Science |
WOS记录号 | WOS:000265341200005 |
出版者 | ELSEVIER SCIENCE BV |
引用统计 | |
文献类型 | 期刊论文 |
条目标识符 | http://ir.amss.ac.cn/handle/2S8OKBNM/8062 |
专题 | 应用数学研究所 |
通讯作者 | Hu, Xiaodong |
作者单位 | Chinese Acad Sci, Inst Appl Math, Beijing 100190, Peoples R China |
推荐引用方式 GB/T 7714 | Chen, Xujin,Hu, Jie,Hu, Xiaodong. A polynomial solvable minimum risk spanning tree problem with interval data[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,2009,198(1):43-46. |
APA | Chen, Xujin,Hu, Jie,&Hu, Xiaodong.(2009).A polynomial solvable minimum risk spanning tree problem with interval data.EUROPEAN JOURNAL OF OPERATIONAL RESEARCH,198(1),43-46. |
MLA | Chen, Xujin,et al."A polynomial solvable minimum risk spanning tree problem with interval data".EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 198.1(2009):43-46. |
条目包含的文件 | 条目无相关文件。 |
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论