Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem

Edina Marica, Clemens Thielen, Alina Wittmann

Given a directed, discrete-time temporal graph $G=(V,R)$, a start node $s\in V$, and $p\ge 1$ objectives, the single-source multiobjective temporal shortest path problem asks, for…