DMCA

Discrete dynamic shortest path problems in transportation applications: Complexity and algorithms with optimal run time (1999)

by Ismail Chabini
Venue:234 I. Chabini. Minimum expected travel times in stochastic time-dependent networks revisited. Internal Report. MIT
Citations:78 - 2 self