期刊
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
卷 158, 期 3, 页码 570-576出版社
ELSEVIER
DOI: 10.1016/S0377-2217(03)00373-4
关键词
combinatorial optimization; robust optimization; shortest path problem; interval data; computational complexity
The paper deals with the relative robust shortest path problem in a directed arc weighted graph, where arc lengths are specified as intervals containing possible realizations of arc lengths. The complexity status of this problem has been unknown in the literature. We show that the problem is NP-hard. (C) 2003 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据