{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:13:24Z","timestamp":1759335204680},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_5","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T16:28:21Z","timestamp":1186763301000},"page":"29-36","source":"Crossref","is-referenced-by-count":9,"title":["Periodic Timetable Optimization in Public Transport"],"prefix":"10.1007","author":[{"given":"Christian","family":"Liebchen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","first-page":"415","volume":"79","author":"M. R. Bussieck","year":"1997","unstructured":"Michael R. Bussieck, Thomas Winter, and Uwe Zimmermann. Discrete optimization in public rail transport. Mathematical Programming B, 79:415\u2013444, 1997.","journal-title":"Mathematical Programming B"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ramesh Hariharan, Telikepalli Kavitha, and Kurt Mehlhorn. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs. In Michele Bugliesi et al., editors, ICALP, volume 4051 of Lecture Notes in Computer Science, pages 250\u2013261. Springer, 2006.","DOI":"10.1007\/11786986_23"},{"issue":"262","key":"5_CR3","first-page":"12","volume":"61","author":"R. Huschke","year":"2005","unstructured":"Reinhard Huschke. Schneller Umsteigen. Berliner Zeitung, 61(262):12, 2005. Wednesday, November 9, 2005, In German.","journal-title":"Berliner Zeitung"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Christian Liebchen. Finding short integral cycle bases for cyclic timetabling. In Giuseppe Di Battista and Uri Zwick, editors, ESA, volume 2832 of Lecture Notes in Computer Science, pages 715\u2013726. Springer, 2003.","DOI":"10.1007\/978-3-540-39658-1_64"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Christian Liebchen. A cut-based heuristic to produce almost feasible periodic railway timetables. In Sotiris E. Nikoletseas, editor, WEA, volume 3503 of Lecture Notes in Computer Science, pages 354\u2013366. Springer, 2005.","DOI":"10.1007\/11427186_31"},{"key":"5_CR6","unstructured":"Christian Liebchen. Der Berliner U-Bahn Fahrplan 2005 \u2014 Realisierung eines mathematisch optimierten Angebotskonzeptes. In HEUREKA\u2019 05: Optimierung in Transport und Verkehr, Tagungsbericht, number 002\/81. FGSV Verlag, 2005. In German."},{"issue":"11","key":"5_CR7","first-page":"689","volume":"54","author":"C. Liebchen","year":"2005","unstructured":"Christian Liebchen. Fahrplanoptimierung im Personenverkehr\u2014Muss es immer ITF sein? Eisenbahntechnische Rundschau, 54(11):689\u2013702, 2005. In German.","journal-title":"Eisenbahntechnische Rundschau"},{"key":"5_CR8","unstructured":"Christian Liebchen. Periodic Timetable Optimization in Public Transport. dissertation.de, 2006. PhD thesis."},{"key":"5_CR9","unstructured":"Thomas Lindner. Train Schedule Optimization in Public Rail Transport. Ph.D. thesis, Technische Universit\u00e4t Braunschweig, 2000."},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Christian Liebchen and Rolf H. M\u00f6hring. A case study in periodic timetabling. Electr. Notes in Theoretical Computer Science, 66(6), 2002.","DOI":"10.1016\/S1571-0661(04)80526-7"},{"key":"5_CR11","unstructured":"Christian Liebchen and Rolf H. M\u00f6hring. The modeling power of the periodic event scheduling problem: Railway timetables \u2014 and beyond. Preprint 020\/2004, TU Berlin, Mathematical Institute, 2004. To appear in Springer LNCS Volume Algorithmic Methods for Railway Optimization."},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Christian Liebchen, Mark Proksch, and Frank H. Wagner. Performance of algorithms for periodic timetable optimization. To appear in Springer LNEMS PProceedings of the Ninth International Workshop on Computer-Aided Scheduling of Public Transport (CASPT). To appear.","DOI":"10.1007\/978-3-540-73312-6_8"},{"key":"5_CR13","unstructured":"Christian Liebchen and Romeo Rizzi. Cycles bases of graphs. Technical Report 2005-018, TU Berlin, Mathematical Institute, 2005. accepted for publication in Discrete Applied Mathematics."},{"key":"5_CR14","unstructured":"Karl Nachtigall. Periodic Network Optimization and Fixed Interval Timetables. Habilitation thesis, Universit\u00e4t Hildesheim, 1998."},{"issue":"6","key":"5_CR15","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1016\/0191-2615(96)00005-7","volume":"30","author":"M. A. Odijk","year":"1996","unstructured":"Michiel A. Odijk. A constraint generation algorithm for the construction of periodic railway timetables. Transp. Res. B, 30(6):455\u2013464, 1996.","journal-title":"Transp. Res. B"},{"key":"5_CR16","unstructured":"Leon W.P. Peeters. Cyclic Railway Timetable Optimization. Ph.D. thesis, Erasmus Universiteit Rotterdam, 2003."},{"key":"5_CR17","unstructured":"Alexander Schrijver and Adri G. Steenbeek. Dienstregelingontwikkeling voor Railned. Rapport CADANS 1.0, Centrum voor Wiskunde en Informatica, December 1994. In Dutch."},{"issue":"4","key":"5_CR18","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P. Serafini","year":"1989","unstructured":"Paolo Serafini and Walter Ukovich. A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics, 2(4):550\u2013581, 1989.","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:06:23Z","timestamp":1605762383000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_5","relation":{},"subject":[]}}