Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse.

Marcel Jackiewicz Adam Kasperski Pawel Zielinski

Published in: CoRR (2024)

Keyphrases

shortest path problem
computational complexity
shortest path
interval data
single source
combinatorial optimization problems
directed graph
search space
evolutionary algorithm
computationally efficient
multistage
special case
random walk
decision problems
worst case
computational cost
multi objective
lower bound