{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T23:18:48Z","timestamp":1768087128115,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642310867","type":"print"},{"value":"9783642310874","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31087-4_18","type":"book-chapter","created":{"date-parts":[[2012,6,29]],"date-time":"2012-06-29T11:54:10Z","timestamp":1340970850000},"page":"166-175","source":"Crossref","is-referenced-by-count":30,"title":["Solving Periodic Event Scheduling Problems with SAT"],"prefix":"10.1007","author":[{"given":"Peter","family":"Gro\u00dfmann","sequence":"first","affiliation":[]},{"given":"Steffen","family":"H\u00f6lldobler","sequence":"additional","affiliation":[]},{"given":"Norbert","family":"Manthey","sequence":"additional","affiliation":[]},{"given":"Karl","family":"Nachtigall","sequence":"additional","affiliation":[]},{"given":"Jens","family":"Opitz","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Steinke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability. IOS Press (2009)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of Theorem-Proving Procedures. In: Harrison, M.A., Banerji, R.B., Ullman, J.D. (eds.) STOC, pp. 151\u2013158. ACM (1971)","DOI":"10.1145\/800157.805047"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11499107_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2005","unstructured":"E\u00e9n, N., Biere, A.: Effective Preprocessing in SAT Through Variable and Clause Elimination. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol.\u00a03569, pp. 61\u201375. Springer, Heidelberg (2005)"},{"key":"18_CR4","unstructured":"Gro\u00dfmann, P.: Polynomial Reduction from PESP to SAT. Tech. Rep.\u00a04, Knowledge Representation and Reasoning Group, Technische Universit\u00e4t Dresden, 01062 Dresden, Germany (October 2011)"},{"key":"18_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/978-3-642-16242-8_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. H\u00f6lldobler","year":"2010","unstructured":"H\u00f6lldobler, S., Manthey, N., Saptawijaya, A.: Improving Resource-Unaware SAT Solvers. In: Ferm\u00fcller, C., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 519\u2013534. Springer, Heidelberg (2010)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-540-74247-0_1","volume-title":"Algorithmic Methods for Railway Optimization","author":"C. Liebchen","year":"2007","unstructured":"Liebchen, C., M\u00f6hring, R.H.: The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables\u00a0\u2014 and Beyond. In: Geraets, F., Kroon, L.G., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds.) Railway Optimization 2004. LNCS, vol.\u00a04359, pp. 3\u201340. Springer, Heidelberg (2007)"},{"key":"18_CR7","unstructured":"Manthey, N.: Coprocessor \u2013 a Standalone SAT Preprocessor (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1108.6208"},{"key":"18_CR8","unstructured":"Nachtigall, K.: Periodic Network Optimization and Fixed Interval Timetable. Habilitation thesis, University Hildesheim (1998)"},{"key":"18_CR9","unstructured":"Odijk, M.A.: Construction of periodic timetables, Part 1: A cutting plane algorithm (1994)"},{"key":"18_CR10","doi-asserted-by":"crossref","unstructured":"Opitz, J.: Automatische Erzeugung und Optimierung von Taktfahrpl\u00e4nen in Schienenverkehrsnetzen. Reihe: Logistik, Mobilit\u00e4t und Verkehr, Gabler Verlag | GWV Fachverlage GmbH (2009)","DOI":"10.1007\/978-3-8349-8466-1"},{"issue":"2","key":"18_CR11","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/s10601-008-9061-0","volume":"14","author":"N. Tamura","year":"2009","unstructured":"Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling finite linear CSP into SAT. Constraints\u00a014(2), 254\u2013272 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Advanced Research in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31087-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:44:03Z","timestamp":1620128643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31087-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642310867","9783642310874"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31087-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}