{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:46:53Z","timestamp":1742399213834},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540200642"},{"type":"electronic","value":"9783540396581"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39658-1_64","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T23:24:30Z","timestamp":1279841070000},"page":"715-726","source":"Crossref","is-referenced-by-count":23,"title":["Finding Short Integral Cycle Bases for Cyclic Timetabling"],"prefix":"10.1007","author":[{"given":"Christian","family":"Liebchen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"64_CR1","unstructured":"Amaldi, E.: Personal Communication. Politecnico di Milano, Italy (2003)"},{"key":"64_CR2","volume-title":"The Theory of Graphs and its Applications","author":"C. Berge","year":"1962","unstructured":"Berge, C.: The Theory of Graphs and its Applications. John Wiley & Sons, Chichester (1962)"},{"key":"64_CR3","unstructured":"Berger, F.: Minimale Kreisbasen in Graphen. Lecture on the annual meeting of the DMV in Halle, Germany (2002)"},{"key":"64_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0012-365X(87)90244-5","volume":"64","author":"C. Champetier","year":"1987","unstructured":"Champetier, C.: On the Null-Homotopy of Graphs. Discrete Mathematics\u00a064, 97\u201398 (1987)","journal-title":"Discrete Mathematics"},{"key":"64_CR5","unstructured":"CPLEX 8.0 ILOG SA, France (2002), http:\/\/www.ilog.com\/products\/cplex"},{"key":"64_CR6","unstructured":"Deo, N., Kumar, N., Parsons, J.: Minimum-Length Fundamental-Cycle Set Problem: A New Heuristic and an SIMD Implementation. Technical Report CS-TR-95-04, University of Central Florida, Orlando (1995)"},{"key":"64_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/355984.355988","volume":"8","author":"N. Deo","year":"1982","unstructured":"Deo, N., Prabhu, M., Krishnamoorthy, M.S.: Algorithms for Generating Fundamental Cycles in a Graph. ACM Transactions on Mathematical Software\u00a08, 26\u201342 (1982)","journal-title":"ACM Transactions on Mathematical Software"},{"key":"64_CR8","unstructured":"Gleiss, P.: Short Cycles. Ph.D. Thesis, University of Vienna, Austria (2001)"},{"key":"64_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45471-3_21","volume-title":"Algorithm Theory - SWAT 2002","author":"A. Golynski","year":"2002","unstructured":"Golynski, A., Horton, J.D.: A Polynomial Time Algorithm to Find the Minimum Cycle Basis of a Regular Matroid. In: Penttonen, M., Schmidt, E.M. (eds.) SWAT 2002. LNCS, vol.\u00a02368, p. 200. Springer, Heidelberg (2002)"},{"key":"64_CR10","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1002\/jgt.3190130115","volume":"13","author":"D. Hartvigsen","year":"1989","unstructured":"Hartvigsen, D., Zemel, E.: Is Every Cycle Basis Fundamental? Journal of Graph Theory\u00a013, 117\u2013137 (1989)","journal-title":"Journal of Graph Theory"},{"key":"64_CR11","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1137\/0216026","volume":"16","author":"J.D. Horton","year":"1987","unstructured":"Horton, J.D.: A polynomial-time algorithm to find the shortest cycle basis of a graph. SIAM Journal on Computing\u00a016, 358\u2013366 (1987)","journal-title":"SIAM Journal on Computing"},{"key":"64_CR12","unstructured":"Krista, M.: Verfahren zur Fahrplanoptimierung dargestellt am Beispiel der Synchronzeiten (Methods for Timetable Optimization Illustrated by Synchronous Times). Ph.D. Thesis, Technical University Braunschweig, Germany. (1996) in German"},{"key":"64_CR13","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF01457454","volume":"261","author":"A.K. Lenstra","year":"1982","unstructured":"Lenstra, A.K., Lenstra, H.W., Lov\u00e1sz, L.: Factoring polynomials with rational coefficients. Mathematische Annalen\u00a0261, 515\u2013534 (1982)","journal-title":"Mathematische Annalen"},{"key":"64_CR14","doi-asserted-by":"crossref","first-page":"16","DOI":"10.37236\/1354","volume":"5","author":"J. Leydold","year":"1998","unstructured":"Leydold, J., Stadler, P.F.: Minimal Cycle Bases of Outerplanar Graphs. The Electronic Journal of Combinatorics\u00a05, #16 (1998)","journal-title":"The Electronic Journal of Combinatorics"},{"key":"64_CR15","unstructured":"Liebchen, C., Peeters, L.: On Cyclic Timetabling and Cycles in Graphs. Technical Report 761\/2002, TU Berlin (2002)"},{"key":"64_CR16","volume-title":"Operations Research 2001","author":"C. Liebchen","year":"2002","unstructured":"Liebchen, C., Peeters, L.: Some Practical Aspects of Periodic Timetabling. In: Chamoni, P., et al. (eds.) Operations Research 2001. Springer, Heidelberg (2002)"},{"key":"64_CR17","unstructured":"Nachtigall, K.: A Branch and Cut Approach for Periodic Network Programming. Hildesheimer Informatik-Berichte, 29 (1994)"},{"key":"64_CR18","unstructured":"Nachtigall, K.: Cutting planes for a polyhedron associated with a periodic network. DLR Interner Bericht, 17 (1996)"},{"key":"64_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(95)00073-Z","volume":"69","author":"K. Nachtigall","year":"1996","unstructured":"Nachtigall, K.: Periodic network optimization with different arc frequencies. Discrete Applied Mathematics\u00a069, 1\u201317 (1996)","journal-title":"Discrete Applied Mathematics"},{"key":"64_CR20","unstructured":"Odijk, M.: Railway Timetable Generation. Ph.D. Thesis, TU Delft, The Netherlands (1997)"},{"key":"64_CR21","unstructured":"de Pina, J.C.: Applications of Shortest Path Methods. Ph.D. Thesis, University of Amsterdam, The Netherlands (1995)"},{"key":"64_CR22","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming, 2nd edn. Wiley, Chichester (1998)","edition":"2"},{"key":"64_CR23","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1137\/0402049","volume":"2","author":"P. Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM Journal on Discrete Mathematics\u00a02, 550\u2013581 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"64_CR24","doi-asserted-by":"publisher","first-page":"509","DOI":"10.2307\/2371182","volume":"57","author":"H. Whitney","year":"1935","unstructured":"Whitney, H.: On the Abstract Properties of Linear Dependence. American Journal of Mathematics\u00a057, 509\u2013533 (1935)","journal-title":"American Journal of Mathematics"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-39658-1_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T11:04:04Z","timestamp":1591527844000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39658-1_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540200642","9783540396581"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39658-1_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}