A polynomial algorithm for minimizing travel time in consistent time-dependent networks with waits.

Jérémy Omer Michael Poss

Published in: Networks (2021)

Keyphrases

travel time
dynamic programming
np hard
optimal solution
objective function
computational complexity
cost function
search strategy
special case
worst case
transportation networks
multi objective
principal component analysis