The Robust Shortest Path Problem with Interval Data

Motivated by telecommunication applications, we investigate the shortest path problem on directed acyclic graphs under arc length uncertainties represented as interval numbers. Using a minimax-regret criterion we define and identify robust paths via mixed-integer programming and exploiting interesting structural properties of the problem.

Citation

Bilkent University, Department of Industrial Engineering, Technical Report August 2001

Article

Download

View The Robust Shortest Path Problem with Interval Data