{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:07Z","timestamp":1725491767182},"publisher-location":"Berlin, Heidelberg","reference-count":42,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742456"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74247-0_3","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T02:33:12Z","timestamp":1189737192000},"page":"67-90","source":"Crossref","is-referenced-by-count":57,"title":["Timetable Information: Models and Algorithms"],"prefix":"10.1007","author":[{"given":"Matthias","family":"M\u00fcller-Hannemann","sequence":"first","affiliation":[]},{"given":"Frank","family":"Schulz","sequence":"additional","affiliation":[]},{"given":"Dorothea","family":"Wagner","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Zaroliagis","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/11602613_68","volume-title":"Algorithms and Computation","author":"H. Ackermann","year":"2005","unstructured":"Ackermann, H., Newman, A., R\u00f6glin, H., V\u00f6cking, B.: Decision making based on approximate and smoothed pareto curves. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol.\u00a03827, pp. 675\u2013684. Springer, Heidelberg (2005)"},{"key":"3_CR2","unstructured":"Baumann, N., Schmidt, R.: Buxtehude\u2013Garmisch in 6 Sekunden. Die elektronische Fahrplanauskunft (EFA) der Deutschen Bundesbahn. Die Bundesbahn. Zeitschrift f\u00fcr aktuelle Verkehrsfragen, 10, 929\u2013931 (1988)"},{"key":"3_CR3","unstructured":"Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. Technical Report ALCOMFT-TR-01-176, BRICS, University of Aarhus, Denmark (2001), http:\/\/www.brics.dk\/ALCOM-FT\/TR\/ALCOMFT-TR-01-176.html"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Brodal, G.S., Jacob, R.: Time-dependent networks as models to achieve fast exact time-table queries. In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol.\u00a092, Elsevier, Amsterdam (2004), A previous version appeared as [3]","DOI":"10.1016\/j.entcs.2003.12.019"},{"key":"3_CR5","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1016\/0022-247X(66)90009-6","volume":"14","author":"K.L. Cooke","year":"1966","unstructured":"Cooke, K.L., Halsey, E.: The shortest route through a network with time-dependent internodal transit times. Journal of Mathematical Analysis and Applications\u00a014, 493\u2013498 (1966)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"3_CR6","unstructured":"DELFI. Durchg\u00e4ngige elektronische Fahrplaninformation, http:\/\/www.delfi.de\/"},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"3_CR8","unstructured":"EFA. A timetable information system by Mentz Datenverarbeitung GmbH, M\u00fcnchen, Germany, http:\/\/www.mentzdv.de\/"},{"key":"3_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-22199-0","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2000","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2000)"},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/b101915","volume-title":"Multiple Criteria Optimization \u2014 State of the Art Annotated Bibliographic Surveys","author":"M. Ehrgott","year":"2002","unstructured":"Ehrgott, M., Gandibleux, X.: Multiobjective combinatorial optimization. In: Multiple Criteria Optimization \u2014 State of the Art Annotated Bibliographic Surveys, pp. 369\u2013444. Kluwer Academic Publishers, Boston, MA (2002)"},{"key":"3_CR11","unstructured":"EUSpirit. European travel information system, http:\/\/www.eu-spirit.com\/"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1287\/trsc.31.4.337","volume":"31","author":"S. Gabriel","year":"1997","unstructured":"Gabriel, S., Bernstein, D.: The traffic equilibrium problem with nonadditive path costs. Transportation Science\u00a031(4), 337\u2013348 (1997)","journal-title":"Transportation Science"},{"key":"3_CR13","unstructured":"HAFAS. A timetable information system by HaCon Ingenieurgesellschaft mbH, Hannover, Germany, http:\/\/www.hacon.de\/hafas\/"},{"key":"3_CR14","series-title":"Lecture Notes in Economics and Mathematical Systems","first-page":"109","volume-title":"Multiple Criteria Decision Making Theory and Applications","author":"P. Hansen","year":"1979","unstructured":"Hansen, P.: Bicriteria path problems. In: Fandel, G., Gal, T. (eds.) Multiple Criteria Decision Making Theory and Applications. Lecture Notes in Economics and Mathematical Systems, vol.\u00a0177, pp. 109\u2013127. Springer, Berlin (1979)"},{"key":"3_CR15","unstructured":"Hensen, D., Truong, T.: Valuation of travel times savings. Journal of Transport Economics and Policy, 237\u2013260 (1985)"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jmaa.1993.1067","volume":"173","author":"M.M. Kostreva","year":"1993","unstructured":"Kostreva, M.M., Wiecek, M.M.: Time dependency in multiple objective dynamic programming. Journal of Mathematical Analysis and Applications\u00a0173, 289\u2013307 (1993)","journal-title":"Journal of Mathematical Analysis and Applications"},{"key":"3_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF00936165","volume":"43","author":"P. Loridan","year":"1984","unstructured":"Loridan, P.: \u03b5-solutions in vector minimization problems. Journal of Optimization Theory and Applications\u00a043, 265\u2013276 (1984)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/0377-2217(84)90077-8","volume":"16","author":"E.Q.V. Martins","year":"1984","unstructured":"Martins, E.Q.V.: On a multicriteria shortest path problem. European Journal of Operations Research\u00a016, 236\u2013245 (1984)","journal-title":"European Journal of Operations Research"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"M\u00f6hring, R.: Verteilte Verbindungssuche im \u00f6ffentlichen Personenverkehr: Graphentheoretische Modelle und Algorithmen. In: Angewandte Mathematik \u2013 insbesondere Informatik, Vieweg, pp. 192\u2013220 (1999)","DOI":"10.1007\/978-3-322-83092-0_11"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"M\u00fcller-Hannemann, M., Schnee, M.: Finding all attractive train connections by multi-criteria Pareto search. In: Proceedings of the 4th Workshop in Algorithmic Methods and Models for Optimization of Railways (ATMOS 2004), vol. 4359, pp. 246\u2013263 (to appear)","DOI":"10.1007\/978-3-540-74247-0_13"},{"key":"3_CR21","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proceedings of the 2nd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2002)","author":"M. M\u00fcller-Hannemann","year":"2002","unstructured":"M\u00fcller-Hannemann, M., Schnee, M., Weihe, K.: Getting train timetables into the main storage. In: Proceedings of the 2nd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2002). Electronic Notes in Theoretical Computer Science, vol.\u00a066, Elsevier, Amsterdam (2002)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/3-540-44688-5_15","volume-title":"Algorithm Engineering","author":"M. M\u00fcller-Hannemann","year":"2001","unstructured":"M\u00fcller-Hannemann, M., Weihe, K.: Pareto shortest paths is often feasible in practice. In: Brodal, G.S., Frigioni, D., Marchetti-Spaccamela, A. (eds.) WAE 2001. LNCS, vol.\u00a02141, pp. 185\u2013198. Springer, Heidelberg (2001)"},{"key":"3_CR23","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/0377-2217(94)E0349-G","volume":"83","author":"K. Nachtigal","year":"1995","unstructured":"Nachtigal, K.: Time depending shortest-path problems with applications to railway networks. European Journal of Operations Research\u00a083, 154\u2013166 (1995)","journal-title":"European Journal of Operations Research"},{"key":"3_CR24","doi-asserted-by":"crossref","unstructured":"Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. Journal of the ACM, 37(3) (1990)","DOI":"10.1145\/79147.214078"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Orda, A., Rom, R.: Minimum weight paths in time-dependent networks. Networks, 21 (1991)","DOI":"10.1002\/net.3230210304"},{"key":"3_CR26","volume-title":"Equilibrium and Advanced Transportation Modelling, ch.\u00a011","author":"S. Pallottino","year":"1998","unstructured":"Pallottino, S., Scutell\u00e0, M.G.: Shortest path algorithms in transportation models: Classical and innovative aspects. In: Equilibrium and Advanced Transportation Modelling, ch.\u00a011, Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"3_CR27","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proc.\u00a041st IEEE Symp.\u00a0on Foundations of Computer Science \u2013 FOCS 2000, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"3_CR28","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Experimental comparison of shortest path approaches for timetable information. In: Proceedings of the Sixth Workshop on Algorithm Engineering and Experiments, SIAM, pp. 88\u201399 (2004)"},{"key":"3_CR29","series-title":"Electronic Notes in Theoretical Computer Science","first-page":"85","volume-title":"Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003)","author":"E. Pyrga","year":"2004","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Towards realistic modeling of time-table information through the time-dependent approach. In: Proceedings of the 3rd Workshop on Algorithmic Methods and Models for Optimization of Railways (ATMOS 2003). Electronic Notes in Theoretical Computer Science, vol.\u00a092, pp. 85\u2013103. Elsevier, Amsterdam (2004)"},{"key":"3_CR30","doi-asserted-by":"crossref","unstructured":"Pyrga, E., Schulz, F., Wagner, D., Zaroliagis, C.: Efficient Models for Timetable Information in Public Transportation Systems. ACM Journal of Experimental Algorithmics, 12(2.4) (2007)","DOI":"10.1145\/1227161.1227166"},{"key":"3_CR31","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-7091-9076-0_9","volume-title":"Computational Graph Theory","author":"G. Rote","year":"1990","unstructured":"Rote, G.: Path problems in graphs. In: Tinhofer, G., Mayr, E., Noltemeier, H., Syslo, M. (eds.) Computational Graph Theory, pp. 155\u2013190. Springer, Heidelberg (1990)"},{"key":"3_CR32","unstructured":"Schulz, F.: Timetable Information and Shortest Paths. PhD thesis, Universit\u00e4t Karlsruhe (TH), Fakult\u00e4t Informatik (2005)"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Schulz, F., Wagner, D., Weihe, K.: Dijkstra\u2019s algorithm on-line: An empirical case study from public railroad transport. Journal of Experimental Algorithmics, 5(12) (2000)","DOI":"10.1145\/351827.384254"},{"key":"3_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-45643-0_4","volume-title":"Algorithm Engineering and Experiments","author":"F. Schulz","year":"2002","unstructured":"Schulz, F., Wagner, D., Zaroliagis, C.: Using multi-level graphs for timetable information in railway systems. In: Mount, D.M., Stein, C. (eds.) ALENEX 2002. LNCS, vol.\u00a02409, pp. 43\u201359. Springer, Heidelberg (2002)"},{"key":"3_CR35","unstructured":"Theune, D.: Robuste und effiziente Methoden zur L\u00f6sung von Wegproblemen. Teubner Verlag, Stuttgart (1995)"},{"key":"3_CR36","doi-asserted-by":"crossref","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective optimization: Improved FPTAS for shortest paths and non-linear objectives with applications. Theory of Computing Systems (to appear, 2007)","DOI":"10.1007\/11940128_40"},{"key":"3_CR37","unstructured":"Tulp, E., Sikl\u00f3ssy, L.: TRAINS, an active time-table searcher. In: Eighth European Conf. on AI, pp. 170\u2013175 (1988)"},{"key":"3_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1201","DOI":"10.1007\/978-3-540-27836-8_99","volume-title":"Automata, Languages and Programming","author":"S. Vassilvitskii","year":"2004","unstructured":"Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 1201\u20131213. Springer, Heidelberg (2004)"},{"key":"3_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-70918-3_3","volume-title":"STACS 2007","author":"D. Wagner","year":"2007","unstructured":"Wagner, D., Willhalm, T.: Speed-up techniques for shortest-path computations. In: Thomas, W., Weil, P. (eds.) STACS 2007. LNCS, vol.\u00a04393, pp. 23\u201336. Springer, Heidelberg (2007)"},{"key":"3_CR40","doi-asserted-by":"crossref","unstructured":"Wagner, D., Willhalm, T., Zaroliagis, C.: Geometric containers for efficient shortest-path computation. ACM Journal of Experimental Algorithmics, 10 (2005)","DOI":"10.1145\/1064546.1103378"},{"key":"3_CR41","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","volume":"35","author":"A. Warburton","year":"1987","unstructured":"Warburton, A.: Approximation of pareto optima in multiple-objective shortest path problems. Operations Research\u00a035, 70\u201379 (1987)","journal-title":"Operations Research"},{"key":"3_CR42","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/BF00940762","volume":"49","author":"D.J. White","year":"1986","unstructured":"White, D.J.: Epsilon efficiency. Jorunal of Optimization Theory and Applications\u00a049, 319\u2013337 (1986)","journal-title":"Jorunal of Optimization Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Methods for Railway Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74247-0_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:20:04Z","timestamp":1605763204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74247-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742456"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74247-0_3","relation":{},"subject":[]}}