{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:04:12Z","timestamp":1725559452807},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540259206"},{"type":"electronic","value":"9783540320784"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11427186_31","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T21:38:24Z","timestamp":1279057104000},"page":"354-366","source":"Crossref","is-referenced-by-count":4,"title":["A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables"],"prefix":"10.1007","author":[{"given":"Christian","family":"Liebchen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","first-page":"284","volume-title":"Proceedings of the 27th Annual ACM Symposium on Theory of Computing","author":"S. Arora","year":"1995","unstructured":"Arora, S., Karger, D., Karpinski, M.: Polynomial Time Approximation Schemes for Dense Instances of NP-hard Problems. In: Proceedings of the 27th Annual ACM Symposium on Theory of Computing, pp. 284\u2013293. ACM Press, New York (1995)"},{"key":"31_CR2","unstructured":"CPLEX\u00a08.1\u00a0 ILOG\u00a0SA, France (2004), \n                    \n                      http:\/\/www.ilog.com\/products\/cplex"},{"key":"31_CR3","unstructured":"Crescenzi, P., Kann, V.: A compendium of NP optimization problems (2005), \n                    \n                      http:\/\/www.nada.kth.se\/~viggo\/problemlist\/compendium.html"},{"key":"31_CR4","series-title":"LNEMS","first-page":"39","volume-title":"Computer-Aided Transit Scheduling\u2014 Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport","author":"J.R. Daduna","year":"1995","unstructured":"Daduna, J.R., Vo\u00df, S.: Practical Experiences in Schedule Synchronization. In: Daduna, J.R., et al. (eds.) Computer-Aided Transit Scheduling\u2014 Proceedings of the Sixth International Workshop on Computer-Aided Scheduling of Public Transport. LNEMS, vol.\u00a0430, pp. 39\u201355. Springer, Heidelberg (1995)"},{"key":"31_CR5","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1111\/j.1475-3995.2004.00465.x","volume":"11","author":"O. Engelhardt-Funke","year":"2004","unstructured":"Engelhardt-Funke, O., Kolonko, M.: Analysing stability and investments in railway networks using advanced evolutionary algorithms. International Transactions in Operational Research\u00a011, 381\u2013394 (2004)","journal-title":"International Transactions in Operational Research"},{"key":"31_CR6","first-page":"422","volume-title":"Proceedings of the 26th Annual ACM Symposium on Theory of Computing","author":"M. Goemans","year":"1994","unstructured":"Goemans, M., Williamson, D.: 878-Approximation Algorithms for Max\u00a0Cut and Max\u00a02Sat. In: Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pp. 422\u2013431. ACM Press, New York (1994)"},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.44.4.570","volume":"44","author":"R. Hassin","year":"1996","unstructured":"Hassin, R.: A Flow Algorithm for Network Synchronization. Operations Research\u00a044, 570\u2013579 (1996)","journal-title":"Operations Research"},{"key":"31_CR8","unstructured":"Liebchen, C.: Der Berliner U-Bahn Fahrplan 2005: Realisierung eines mathematisch optimierten Angebotskonzepts. In: Tagungsbericht Heureka 2005 Optimierung in Transport und Verkehr, FGSV (2005) (in German)"},{"key":"31_CR9","unstructured":"Liebchen, C., M\u00f6hring, R.H.: The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables\u2014and Beyond. Preprint 020\/2004, Mathematical Institute, TU Berlin, Germany (2004)"},{"key":"31_CR10","unstructured":"Liebchen, C., Proksch, M., Wagner, F.H.: Performance of Algorithms for Periodic Timetable Optimization. Preprint 021\/2004, Mathematical Institute, TU Berlin, Germany (2004)"},{"key":"31_CR11","unstructured":"Lindner, T.: Train Schedule Optimization in Public Rail Transport. Ph.D.\u00a0Thesis, TU\u00a0Braunschweig, Germany (2000)"},{"key":"31_CR12","unstructured":"Martin, A., Achterberg, T., Koch, T.: MIPLIB\u00a02003 (2003), \n                    \n                      http:\/\/www.zib.de\/miplib"},{"key":"31_CR13","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/0305-0548(95)00032-1","volume":"23","author":"K. Nachtigall","year":"1996","unstructured":"Nachtigall, K., Voget, S.: A genetic\u00a0algorithm approach to periodic railway synchronization. Computers and Operations Research\u00a023, 453\u2013463 (1996)","journal-title":"Computers and Operations Research"},{"key":"31_CR14","unstructured":"Odijk, M.: Railway Timetable Generation. Ph.D.\u00a0Thesis, TU Delft, The Netherlands (1997)"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, Approximation, and Complexity Classes. Journal of Computer and System Sciences\u00a043, 425\u2013440 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR16","unstructured":"Peeters, L.: Cyclic Railway Timetable Optimization. Ph.D.\u00a0Thesis, Erasmus Universiteit Rotterdam, The Netherlands (2003)"},{"key":"31_CR17","unstructured":"Schrijver, A., Steenbeek, A.: Dienstregelingontwikkeling voor Nederlandse Spoorwegen N.V.\u2014Rapport Fase\u00a01. Report, CWI, The Netherlands. In: Dutch (1993)"},{"key":"31_CR18","first-page":"550","volume":"2","author":"P. Serafini","year":"1989","unstructured":"Serafini, P., Ukovich, W.: A mathematical model for periodic scheduling problems. SIAM\u00a0Journal on Discrete\u00a0Mathematics\u00a02, 550\u2013581 (1989)","journal-title":"SIAM\u00a0Journal on Discrete\u00a0Mathematics"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(81)90023-6","volume":"34","author":"P.M.B. Vitanyi","year":"1981","unstructured":"Vitanyi, P.M.B.: How Well Can a Graph be n-Colored? Discrete Mathematics\u00a034, 69\u201380 (1981)","journal-title":"Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Experimental and Efficient Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11427186_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:06:55Z","timestamp":1619507215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11427186_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540259206","9783540320784"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11427186_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}