Journal
OPERATIONS RESEARCH LETTERS
Volume 32, Issue 3, Pages 225-232Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.orl.2003.08.002
Keywords
branch and bound; shortest path problem; robust optimization; interval data
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available