The robust shortest path problem in series-parallel multidigraphs with interval data

Authors:
Adam Kasperski;Paweł ZielińSki
Affiliations:
Institute of Industrial Engineering and Management, Wrocław University of Technology, Wybrzee Wyspiańskiego 27, 50-370 Wrocław, Poland;Institute of Mathematics, Wrocław University of Technology, Wybrzee Wyspiańskiego 27, 50-370 Wrocław, Poland
Venue:
Operations Research Letters
Year:
2006

Citing 6
Cited 7

On the robust shortest path problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Interval data minmax regret network optimization problems

Discrete Applied Mathematics
An exact algorithm for the robust shortest path problem with interval data

Computers and Operations Research
On the hardness of evaluating criticality of activities in a planar network with duration intervals

Operations Research Letters
A branch and bound algorithm for the robust shortest path problem with interval data

Operations Research Letters

Some tractable instances of interval data minmax regret problems: bounded distance from triviality

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Criticality analysis of activity networks under interval uncertainty

Journal of Scheduling
Reduction approaches for robust shortest path problems

Computers and Operations Research
Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks

INFORMS Journal on Computing
Some tractable instances of interval data minmax regret problems

Operations Research Letters
On the existence of an FPTAS for minmax regret combinatorial optimization problems with interval data

Operations Research Letters
Minmax regret bottleneck problems with solution-induced interval uncertainty structure

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper the robust shortest path problem in edge series-parallel multidigraphs with interval costs is examined. The maximal regret criterion is applied to calculate the optimal solution. It is shown that this problem is NP-hard. A pseudopolynomial algorithm for the studied problem is constructed.