-
1
-
-
0003515463
-
-
Englewood Cliffs, NJ: Prentice-Hall
-
Ahuja, R.K., T.L. Magnanti and J.B. Orlin (1993), Network Flows: Theory, Algorithms and Applications, Englewood Cliffs, NJ: Prentice-Hall.
-
(1993)
Network Flows: Theory, Algorithms and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
2
-
-
26444445719
-
Variational inequality model of ideal dynamic useroptimal route choice
-
M.G.H. Bell (ed.), Oxford: Elsevier
-
Boyce, D.E., D.H. Lee and B.N. Janson (1998), ‘Variational inequality model of ideal dynamic useroptimal route choice’, in M.G.H. Bell (ed.), Transportation Networks: Recent Methodological Advances’, Oxford: Elsevier, pp. 289-302.
-
(1998)
Transportation Networks: Recent Methodological Advances’
, pp. 289-302
-
-
Boyce, D.E.1
Lee, D.H.2
Janson, B.N.3
-
5
-
-
0011762109
-
-
Technical Report 93-1480, Computer Science Department, Stanford University, Stanford, CA
-
Cherkassky, B.V., A.V. Goldberg and T. Radzik (1993), ‘Shortest paths algorithms: theory and experimental evaluation’, Technical Report 93-1480, Computer Science Department, Stanford University, Stanford, CA.
-
(1993)
Shortest Paths Algorithms: Theory and Experimental Evaluation
-
-
Cherkassky, B.V.1
Goldberg, A.V.2
Radzik, T.3
-
7
-
-
26444476561
-
Analysis of lane-blocking events with an analytical dynamic traffic assignment model
-
Lee, D.H., D.E. Boyce and B.N. Janson (2002), ‘Analysis of lane-blocking events with an analytical dynamic traffic assignment model’, Intelligent Transportation Systems, 6, 351-74.
-
(2002)
Intelligent Transportation Systems
, vol.6
, pp. 351-374
-
-
Lee, D.H.1
Boyce, D.E.2
Janson, B.N.3
-
9
-
-
0025658811
-
A highway capacity function in korea: Measurement and calibration
-
Suh, S., C.-H. Park and T.J. Kim (1990), ‘A highway capacity function in Korea: measurement and calibration’, Transportation Research, 24A (3), 176-86.
-
(1990)
Transportation Research
, vol.24A
, Issue.3
, pp. 176-186
-
-
Suh, S.1
Park, C.-H.2
Kim, T.J.3
-
10
-
-
0031997181
-
Shortest path algorithms: An evaluation using real road networks
-
Zhan, F.B. and C.E. Noon (1996), ‘Shortest path algorithms: an evaluation using real road networks’, Transportation Science, 32 (1), 65-73.
-
(1996)
Transportation Science
, vol.32
, Issue.1
, pp. 65-73
-
-
Zhan, F.B.1
Noon, C.E.2
-
11
-
-
0003320681
-
Three fastest shortest path algorithms on real road networks: Data structures and procedures
-
5 March 2003
-
Zhan, F.B. (1997), ‘Three fastest shortest path algorithms on real road networks: data structures and procedures’, Journal of Geographic Information and Decision Analysis, 1 (1), 70-82. The article can be seen in http://publish.uwo.ca/njmalczew/gida1/Zhan/Zhan-htm, (accessed 5 March 2003).
-
(1997)
Journal of Geographic Information and Decision Analysis
, vol.1
, Issue.1
, pp. 70-82
-
-
Zhan, F.B.1
-
12
-
-
0037634681
-
A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths
-
The article can be also found, 5 March 2003
-
Zhan, F.B. and C.E. Noon (2000), ‘A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths’, Journal of Geographic Information and Decision Analysis, 4 (2), 1-13. The article can be also found in http://publish.uwo.ca/njmalczew/gida_8/Zhan/Zhan_Noon.html, (accessed 5 March 2003).
-
(2000)
Journal of Geographic Information and Decision Analysis
, vol.4
, Issue.2
, pp. 1-13
-
-
Zhan, F.B.1
Noon, C.E.2
|