M. M. Hannemann, F. Schulz, D. Wagner, and C. Zaroliagis, Timetable Information: Models and Algorithms, In Lecture Notes in Computer Science, vol.4359, pp.67-90, 2007.
DOI : 10.1007/978-3-540-74247-0_3

F. Schulz, D. Wagner, and K. Weihe, Dijkstra's algorithm on-line, Journal of Experimental Algorithmics, vol.5, pp.110-123, 1999.
DOI : 10.1145/351827.384254

M. M. Hannemann and M. Schnee, Finding All Attractive Train Connections by Multi-criteria Pareto Search, In Lecture Notes in Computer Science, vol.4359, pp.246-263, 2007.
DOI : 10.1007/978-3-540-74247-0_13

G. S. Brodal and R. Jacob, Time-dependent Networks as Models to Achieve Fast Exact Time-table Queries, Electronic Notes in Theoretical Computer Science, vol.92, pp.3-15, 2004.
DOI : 10.1016/j.entcs.2003.12.019

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Towards Realistic Modeling of Time-Table Information through the Time-Dependent Approach, Electronic Notes in Theoretical Computer Science, vol.92, pp.85-103, 2004.
DOI : 10.1016/j.entcs.2003.12.024

Y. Disser, M. M. Hannemann, and M. Schnee, Multi-criteria Shortest Paths in Time-Dependent Train Networks, In Lecture Notes in Computer Science, vol.5038, pp.347-361, 2008.
DOI : 10.1007/978-3-540-68552-4_26

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Experimental comparison of shortest path approaches for timetable information, 6th Workshop on Algorithm Engineering and Experiments (ALENEX04), SIAM, pp.88-99, 2004.

E. Pyrga, F. Schulz, D. Wagner, and C. Zaroliagis, Efficient models for timetable information in public transportation systems, Journal of Experimental Algorithmics (JEA), 2008.
DOI : 10.1145/1227161.1227166

A. J. Skriver and K. A. Andersen, A label correcting approach for solving bicriterion shortest-path problems, Computers & Operations Research, vol.27, issue.6, pp.507-524, 2000.
DOI : 10.1016/S0305-0548(99)00037-4

X. Gandibleux, F. Beugnies, and S. Randriamasy, Martins' algorithm revisited for multi-objective shortest path problems with a MaxMin cost function, 4OR, pp.47-59, 2006.
DOI : 10.1007/s10288-005-0074-x

URL : https://hal.archives-ouvertes.fr/hal-00462028

E. Q. Martins and J. L. Santos, The labeling algorithm for multicriteria shortest path problem, 1999.

J. Brumbaugh and S. , An empirical investigation of some bicriterion shortest path algorithms, European Journal of Operational Research, vol.43, issue.2, pp.216-224, 1989.
DOI : 10.1016/0377-2217(89)90215-4

J. Mote, I. Murthy, and D. L. Olson, A parametric approach to solving bicriterion shortest path problems, European Journal of Operational Research, vol.53, issue.1, pp.81-92, 1991.
DOI : 10.1016/0377-2217(91)90094-C

J. M. Paixao and J. L. Santos, Labeling methods for the general case of the multiobjective shortest path problem?a computational study, Intelligent Systems, Control and Automation: Science and Engineering, pp.489-502, 2013.

G. Mali, P. Michail, and C. Zaroliagis, Faster multiobjective heuristic search in road maps, Proceedings ICT, pp.67-72, 2012.

E. W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik, pp.269-271, 1959.