Solving the recoverable robust shortest path problem in DAGs.

Marcel Jackiewicz Adam Kasperski Pawel Zielinski

Published in: CoRR (2023)

Keyphrases

shortest path problem
directed acyclic graph
shortest path
single source
interval data
directed graph
combinatorial optimization problems
special case
computationally efficient
multiple objectives
bi objective
lower bound
random walk
robust estimation
equivalence class