
The robust shortest path problem in series–parallel multidigraphs with interval data
Keywords: مشکل کوتاهترین مسیر; Robust optimization; NP-hardness; Pseudopolynomial algorithm; Shortest path problem; Combinatorial optimization