Algorithms for minimum-cost paths in time-dependent networks with waiting policies.

Published in: Networks (2004)

Keyphrases

minimum cost
np hard
combinatorial optimization
approximation algorithms
optimization problems
lower and upper bounds
network design
network flow
capacity constraints