{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:26:07Z","timestamp":1761895567603},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,10,30]],"date-time":"2012-10-30T00:00:00Z","timestamp":1351555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10107-012-0610-3","type":"journal-article","created":{"date-parts":[[2012,10,29]],"date-time":"2012-10-29T16:13:39Z","timestamp":1351527219000},"page":"257-297","source":"Crossref","is-referenced-by-count":28,"title":["Dynamic graph generation for the shortest path problem in time expanded networks"],"prefix":"10.1007","volume":"143","author":[{"given":"Frank","family":"Fischer","sequence":"first","affiliation":[]},{"given":"Christoph","family":"Helmberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,30]]},"reference":[{"key":"610_CR1","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1002\/net.10072","volume":"41","author":"RK Ahuja","year":"2003","unstructured":"Ahuja, R.K., Orlin, J.B., Pallottino, S., Scutell\u00e0, M.G.: Dynamic shortest paths minimizing travel times and costs. Networks 41, 205 (2003)","journal-title":"Networks"},{"key":"610_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02216922","volume":"20","author":"J Aronson","year":"1989","unstructured":"Aronson, J.: A survey of dynamic network flows. Ann. Oper. Res. 20, 1\u201366 (1989)","journal-title":"Ann. Oper. Res."},{"key":"610_CR3","unstructured":"Bornd\u00f6rfer, R., Schlechte, T.: Models for railway track allocation. In: Liebchen, C., Ahuja, R.K., Mesa, J.A. (eds.) ATMOS 2007. Dagstuhl, Germany, IBFI, Schloss Dagstuhl, Germany (2007)"},{"issue":"2","key":"610_CR4","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s10288-007-0037-5","volume":"6","author":"V Cacchiani","year":"2008","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: A column generation approach to train timetabling on a corridor. 4OR Q. J. Oper. Res. 6(2), 125\u2013142 (2008)","journal-title":"4OR Q. J. Oper. Res."},{"issue":"2","key":"610_CR5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/j.trb.2009.07.007","volume":"44","author":"V Cacchiani","year":"2010","unstructured":"Cacchiani, V., Caprara, A., Toth, P.: Scheduling extra freight trains on railway networks. Transp. Res. Part B Methodol. 44(2), 215\u2013231 (2010)","journal-title":"Transp. Res. Part B Methodol."},{"issue":"3","key":"610_CR6","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1016\/j.ejor.2011.11.003","volume":"219","author":"V Cacchiani","year":"2012","unstructured":"Cacchiani, V., Toth, P.: Nominal and robust train timetabling problems. Eur. J. Oper. Res. 219(3), 727\u2013737 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"610_CR7","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1287\/opre.50.5.851.362","volume":"50","author":"A Caprara","year":"2002","unstructured":"Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50(5), 851\u2013861 (2002)","journal-title":"Oper. Res."},{"issue":"5","key":"610_CR8","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1016\/j.dam.2005.05.026","volume":"154","author":"A Caprara","year":"2006","unstructured":"Caprara, A., Monaci, M., Toth, P., Guida, P.L.: A lagrangian heuristic algorithm for a real-world train timetabling problem. Discret. Appl. Math. 154(5), 738\u2013753 (2006)","journal-title":"Discret. Appl. Math."},{"key":"610_CR9","doi-asserted-by":"crossref","unstructured":"Delling, D., Wagner, D.: Landmark-based routing in dynamic graphs. In: Demetrescu, C. (ed.) Experimental Algorithms. Lecture Notes in Computer Science, vol. 4525, pp. 52\u201365. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-72845-0_5"},{"key":"610_CR10","unstructured":"Fischer, F., Helmberg, C.: Dynamic graph generation and dynamic rolling horizon techniques in large scale train timetabling. In: Erlebac, T., L\u00fcbbecke, M. (eds.) Proceedings of the 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems. OpenAccess Series in Informatics (OASIcs), vol. 14, pp. 45\u201360, Dagstuhl, Germany, Schloss Dagstuhl\u2013Leibniz\u2013Zentrum fuer Informatik (2010)"},{"key":"610_CR11","unstructured":"Fischer, F., Helmberg, C., Jan\u00dfen, J., Krostitz, B.: Towards solving very large scale train timetabling problems by lagrangian relaxation. In: Fischetti, M., Widmayer, P. (eds.) ATMOS 2008\u20148th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems. Dagstuhl, Germany, Schloss Dagstuhl\u2013Leibniz\u2013Zentrum fuer Informatik, Germany (2008)"},{"key":"610_CR12","volume-title":"Time-Dependent Scheduling","author":"S Gawiejnowicz","year":"2008","unstructured":"Gawiejnowicz, S.: Time-Dependent Scheduling, 1st edn. Springer, Berlin (2008)","edition":"1"},{"key":"610_CR13","first-page":"93","volume-title":"Reach for $$A^*$$ : Shortest Path Algorithms with Preprocessing","author":"AV Goldberg","year":"2009","unstructured":"Goldberg, A.V., Kaplan, H., Werneck, R.F.: Reach for $$A^*$$ : Shortest Path Algorithms with Preprocessing, pp. 93\u2013139. American Mathematical Society (AMS), Providence (2009)"},{"key":"610_CR14","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/S0167-5060(08)70356-X","volume":"4","author":"RL Graham","year":"1979","unstructured":"Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 4, 287\u2013326 (1979)","journal-title":"Ann. Discret. Math."},{"key":"610_CR15","unstructured":"Helmberg, C.: ConicBundle 0.3.11. Fakult\u00e4t f\u00fcr Mathematik, Technische Universit\u00e4t Chemnitz, 2012. http:\/\/www.tu-chemnitz.de\/~helmberg\/ConicBundle"},{"issue":"4","key":"610_CR16","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1287\/opre.1060.0374","volume":"55","author":"C Helmberg","year":"2007","unstructured":"Helmberg, C., R\u00f6hl, S.: A case study of joint online truck scheduling and inventory management for multiple warehouses. Oper. Res. 55(4), 733\u2013752 (2007)","journal-title":"Oper. Res."},{"issue":"17","key":"610_CR17","doi-asserted-by":"crossref","first-page":"3665","DOI":"10.1016\/j.dam.2009.04.007","volume":"157","author":"N Kamiyama","year":"2009","unstructured":"Kamiyama, N., Katoh, N., Takizawa, A.: An efficient algorithm for the evacuation problem in a certain class of networks with uniform path-lengths. Discret. Appl. Math. 157(17), 3665\u20133677 (2009)","journal-title":"Discret. Appl. Math."},{"issue":"4","key":"610_CR18","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1002\/net.20131","volume":"48","author":"GA Klunder","year":"2006","unstructured":"Klunder, G.A., Post, H.N.: The shortest path problem on large-scale real-road networks. Networks 48(4), 182\u2013194 (2006)","journal-title":"Networks"},{"key":"610_CR19","unstructured":"Kotnyek, B.: An Annotated Overview of Dynamic Network Flows. Technical Report RR-4936, INRIA, (2003)"},{"issue":"4","key":"610_CR20","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1007\/s00291-009-0189-0","volume":"33","author":"RM Lusby","year":"2011","unstructured":"Lusby, R.M., Larsen, J., Ehrgott, M., Ryan, D.: Railway track allocation: models and methods. OR Spectr. 33(4), 843\u2013883 (2011)","journal-title":"OR Spectr."},{"key":"610_CR21","doi-asserted-by":"crossref","unstructured":"Potamias, M., Bonchi, F., Castillo, C., Gionis, A.: Fast shortest path distance estimation in large networks. In: Proceedings of the 18th ACM Conference on Information and Knowledge Management, CIKM \u201909, pp. 867\u2013876, ACM, New York (2009)","DOI":"10.1145\/1645953.1646063"},{"key":"610_CR22","doi-asserted-by":"crossref","unstructured":"Skutella, M.: An introduction to network flows over time. In: Research Trends in Combinatorial Optimization, pp. 451\u2013482. Springer (2009)","DOI":"10.1007\/978-3-540-76796-1_21"},{"key":"610_CR23","unstructured":"Yanagisawa, H.: Fast Shortest Path Computation for Solving the Multicommodity Flow Problem. Technical Report RT0688, IBM Tokyo Research Laboratory (2006)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0610-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0610-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0610-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T22:28:03Z","timestamp":1562279283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0610-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,30]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["610"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0610-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,30]]}}}