A platform for research: civil engineering, architecture and urbanism
Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
Finding Minimum-Cost Dynamic Routing Policies in Stochastic-State Networks with Link Failures
Fajardo, D. (author) / Waller, S.T. (author)
TRANSPORTATION RESEARCH RECORD ; 113-121
2012-01-01
9 pages
Article (Journal)
English
DDC:
388
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
British Library Online Contents | 2014
|Finding Reliable Shortest Paths in Dynamic Stochastic Networks
British Library Online Contents | 2013
|Estimation of Expected Minimum Paths in Dynamic and Stochastic Traffic Networks
British Library Conference Proceedings | 1995
|