NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times

Tim Zeitz. NP-hardness of shortest path problems in networks with non-FIFO time-dependent travel times. Inf. Process. Lett., 179:106287, 2023. [doi]

Abstract

Abstract is missing.