{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T20:58:21Z","timestamp":1773694701512,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,29]],"date-time":"2013-07-29T00:00:00Z","timestamp":1375056000000},"content-version":"vor","delay-in-days":4076,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Theoretical Computer Science"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s1571-0661(04)80526-7","type":"journal-article","created":{"date-parts":[[2004,9,29]],"date-time":"2004-09-29T12:47:47Z","timestamp":1096462067000},"page":"18-31","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":54,"title":["A Case Study in Periodic Timetabling"],"prefix":"10.1016","volume":"66","author":[{"given":"Christian","family":"Liebchen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf H.","family":"M\u00f6hring","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/S1571-0661(04)80526-7_NEWBIB1","doi-asserted-by":"crossref","DOI":"10.1145\/355984.355988","article-title":"Algorithms for Generating Fundamental Cycles in a Graph","volume":"Vol. 8","author":"Deo","year":"1982","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB2","unstructured":"N. Deo, N. Kumar, and J. Parsons. Minimum-Length Fundamental-Cycle Set Problem: A New Heuristic and an SIMD Implementation. Technical Report CS-TR-95-04, Univ. Central Florida, Orlando, 1995"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB3","doi-asserted-by":"crossref","DOI":"10.1002\/jgt.3190130115","article-title":"Is Every Cycle Basis Fundamental?","volume":"Vol. 13","author":"Hartvigsen","year":"1989","journal-title":"Journal of Graph Theory"},{"issue":"No. 2","key":"10.1016\/S1571-0661(04)80526-7_NEWBIB4","doi-asserted-by":"crossref","DOI":"10.1137\/0216026","article-title":"A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph","volume":"Vol. 16","author":"Horton","year":"1987","journal-title":"SIAM J. Comput"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB5","series-title":"Computer-Aided Scheduling of Public Transport","article-title":"A Cycle Based Optimization Model for the Cyclic Railway Timetabling Problem","author":"Kroon","year":"2001"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB6","unstructured":"C. Liebchen, and K. N\u00f6kel. \u00dcberf\u00fchrung eines mathematischen Modells zur Taktversatzoptimierung in die Praxis. Tagungsbericht Heureka '02, 2002"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB7","doi-asserted-by":"crossref","unstructured":"C. Liebchen and L. Peeters. Some Practical Aspects of Periodic Timetabling. In Operations Research Proceedings 2001, Springer, 2002","DOI":"10.1007\/978-3-642-50282-8_4"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB8","article-title":"Cutting Planes for a Polyhedron Associated with a Periodic Network","author":"Nachtigall","year":"1996","journal-title":"Institutsbericht IB 112-96\/17, Deutsche Forschungsanstalt f\u00fcr Luftund Raumfahrt e.V"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB9","unstructured":"K. Nachtigall. Periodic Network Optimization and Fixed Interval Timetables. Habilitation thesis, University Hildesheim, 1998"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB10","unstructured":"M. Odijk. Construction of periodic timetables, Part I: A cutting plane algorithm Report 94-61, TU Delft, 1994"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB11","series-title":"Network Flows and Monotropic Optimization","author":"Rockafellar","year":"1984"},{"key":"10.1016\/S1571-0661(04)80526-7_NEWBIB12","series-title":"Theory of Linear and Integer Programming","author":"Schrijver","year":"1986"},{"issue":"No. 4","key":"10.1016\/S1571-0661(04)80526-7_NEWBIB13","doi-asserted-by":"crossref","DOI":"10.1137\/0402049","article-title":"A Mathematical Model for Periodic Scheduling Problems","volume":"Vol. 2","author":"Serafini","year":"1989","journal-title":"SIAM J. Disc. Math"}],"container-title":["Electronic Notes in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805267?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571066104805267?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:05:30Z","timestamp":1761609930000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571066104805267"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S1571066104805267"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0661(04)80526-7","relation":{},"ISSN":["1571-0661"],"issn-type":[{"value":"1571-0661","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Case Study in Periodic Timetabling","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1571-0661(04)80526-7","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}