期刊
OPERATIONS RESEARCH LETTERS
卷 32, 期 3, 页码 225-232出版社
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2003.08.002
关键词
branch and bound; shortest path problem; robust optimization; interval data
Many real problems can be modelled as robust shortest path problems on interval digraphs, where intervals represent uncertainty about real costs and a robust path is not too far from the shortest path for each possible configuration of the arc costs. A branch and bound algorithm for this problem is presented. (C) 2003 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据