algorithms for minimum - cost paths in time - dependent networks with waiting policies .
Dynamic Programming with Convexity, Concavity, and Sparsity