A platform for research: civil engineering, architecture and urbanism
OPTIMAL ROUTING POLICY PROBLEMS IN STOCHASTIC TIME-DEPENDENT NETWORKS PART II: EXACT AND APPROXIMATION ALGORITHMS
OPTIMAL ROUTING POLICY PROBLEMS IN STOCHASTIC TIME-DEPENDENT NETWORKS PART II: EXACT AND APPROXIMATION ALGORITHMS
OPTIMAL ROUTING POLICY PROBLEMS IN STOCHASTIC TIME-DEPENDENT NETWORKS PART II: EXACT AND APPROXIMATION ALGORITHMS
Gao, S. (author) / Chabini, I. (author) / IEEE
International conference; 5th, Intelligent transportation systems ; 2002 ; Singapore
2002-01-01
5 pages
Also known as ITSC 2002. IEEE cat no 02TH8613
Conference paper
English
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
OPTIMAL ROUTING POLICY PROBLEMS IN STOCHASTIC TIME-DEPENDENT NETWORKS PART I: FRAMEWORK AND TAXONOMY
British Library Conference Proceedings | 2002
|Best Routing Policy Problem in Stochastic Time-Dependent Networks
British Library Online Contents | 2002
|Optimal Routing of Hazardous Materials in Stochastic, Time-Varying Transportation Networks
British Library Online Contents | 1998
|