Robust Shortest Path Problems
摘要
We present results on the complexity and approximability of robust shortest path problems for various combinations of decision criterion and uncertainty set.