Azevedo, J. A., Costa, M. E. O. S., Madeira, J. J. E. R. S. and Martins, E. Q. V. (1993). “An algorithm for the ranking of shortest paths.” European Journal of Operational Research, Vol. 69, No. 1, pp. 97-106.10.1016/0377-2217(93)90095-5Azevedo, J. A., Costa, M. E. O. S., Madeira, J. J. E. R. S. and Martins, E. Q. V. (1993). “An algorithm for the ranking of shortest paths.” European Journal of Operational Research, Vol. 69, No. 1, pp. 97-106.

Carey, M. (1992) Nonconvexity of the Dynamic Traffic Assignment Problem. Transportation Research. 26B, pp. 127-133.10.1016/0191-2615(92)90003-FCarey, M. (1992) Nonconvexity of the Dynamic Traffic Assignment Problem. Transportation Research. 26B, pp. 127-133.

Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. and Wie, B. W. (1993). A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Operation. Operations Research. 41, pp. 179-191.10.1287/opre.41.1.179Friesz, T. L., Bernstein, D., Smith, T. E., Tobin, R. L. and Wie, B. W. (1993). A Variational Inequality Formulation of the Dynamic Network User Equilibrium Problem. Operation. Operations Research. 41, pp. 179-191.

Friesz, T. L., Luque, F. J., Tobin, R. L. and Wie, B. W. (1989). Dynamic Network Traffic Assignment Considered As A Continuous Time Optimal Control Problem. Operations Research. 37, pp. 893-901. 10.1287/opre.37.6.893Friesz, T. L., Luque, F. J., Tobin, R. L. and Wie, B. W. (1989). Dynamic Network Traffic Assignment Considered As A Continuous Time Optimal Control Problem. Operations Research. 37, pp. 893-901.

Metchang, D. K. and Nemhausser, G. L. (1978a). A Model and An Algorithm for the Dynamic  Traffic Assignment Problems. Trans-portation Science. 12, pp. 183-199.10.1287/trsc.12.3.183Metchang, D. K. and Nemhausser, G. L. (1978a). A Model and An Algorithm for the Dynamic  Traffic Assignment Problems. Trans-portation Science. 12, pp. 183-199.

Metchang, D. K. and Nemhausser, G. L. (1978b). Optimality Conditions for a dynamic Traffic assignment Model. Transportation Science. 12, pp. 200-207. 10.1287/trsc.12.3.200Metchang, D. K. and Nemhausser, G. L. (1978b). Optimality Conditions for a dynamic Traffic assignment Model. Transportation Science. 12, pp. 200-207.

Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V. and Mishchenko, E. F. (1962). The Mathematical Theory of Optimal Processes. English translation. Interscience. ISBN 2-88124-077-1.Pontryagin, L. S., Boltyanskii, V. G., Gamkrelidze, R. V. and Mishchenko, E. F. (1962). The Mathematical Theory of Optimal Processes. English translation. Interscience. ISBN 2-88124-077-1.

Ran, B. and Boyce, D. E. (1996). Modeling Dynamic Transportation Networks. Springer.10.1007/978-3-642-80230-0Ran, B. and Boyce, D. E. (1996). Modeling Dynamic Transportation Networks. Springer.

Spiess, H. and Florian, M. (1999). “Optimal Strategies : A New Assignment Model for Transit Networks.” Transportation Research B, Vol. 3, No. 2, pp. 83-102.Spiess, H. and Florian, M. (1999). “Optimal Strategies : A New Assignment Model for Transit Networks.” Transportation Research B, Vol. 3, No. 2, pp. 83-102.

Wie, B. W., Friesz, T. L. and Tobin, R. L. (1990). “Dynamic user optimal traffic assignment on congested multidestination Networks.” Transportation Research, 24B, pp. 443-451.10.1016/0191-2615(90)90038-zWie, B. W., Friesz, T. L. and Tobin, R. L. (1990). “Dynamic user optimal traffic assignment on congested multidestination Networks.” Transportation Research, 24B, pp. 443-451.

Wie, B. W., Tobin, R. L., Friesz, T. L. and Bernstein, D. (1995). “A discrete time, Nested cost operator approach to the dynamic network user equilibrium problem.” Transportation Science, Vol. 29, No. 1, pp. 79-92.10.1287/trsc.29.1.79Wie, B. W., Tobin, R. L., Friesz, T. L. and Bernstein, D. (1995). “A discrete time, Nested cost operator approach to the dynamic network user equilibrium problem.” Transportation Science, Vol. 29, No. 1, pp. 79-92.