| Article ID: | iaor20052774 |
| Country: | Netherlands |
| Volume: | 158 |
| Issue: | 3 |
| Start Page Number: | 570 |
| End Page Number: | 576 |
| Publication Date: | Nov 2004 |
| Journal: | European Journal of Operational Research |
| Authors: | Zieliski Pawe |
| Keywords: | computational analysis, optimization |
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