论文信息 - Time depending shortest-path problems with applications to railway networks - 字舞流文

Time depending shortest-path problems with applications to railway networks

[1] Laurent Siklóssy,et al. Searching time-table networks , 1991, Artificial Intelligence for Engineering Design, Analysis and Manufacturing.

[2] Donald Goldfarb,et al. Shortest path algorithms using dynamic breadth-first search , 1991, Networks.

[3] Ariel Orda,et al. Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[4] Dieter Müller. Symmetric connection problems and their solution by bidirectional search , 1990, Int. J. Comput. Math..

[5] Fred W. Glover,et al. A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

[6] E. Martins. On a multicriteria shortest path problem , 1984 .

[7] Michel Minoux,et al. Graphs and Algorithms , 1984 .

[8] Douglas R. Shiert,et al. Properties of Labeling Methods for Determining Shortest Path Trees , 1981 .

[9] I. Anderson,et al. Graphs and Networks , 1981, The Mathematical Gazette.

[10] Nils J. Nilsson,et al. A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..