<?xml version="1.0" encoding="utf-8"?>
<export-example>
  <doc>
    <id>10001</id>
    <completedYear/>
    <publishedYear>2025</publishedYear>
    <thesisYearAccepted/>
    <language>eng</language>
    <pageFirst/>
    <pageLast/>
    <pageNumber/>
    <edition/>
    <issue/>
    <volume/>
    <type>article</type>
    <publisherName>Springer Science and Business Media LLC</publisherName>
    <publisherPlace/>
    <creatingCorporation/>
    <contributingCorporation/>
    <belongsToBibliography>0</belongsToBibliography>
    <completedDate>--</completedDate>
    <publishedDate>--</publishedDate>
    <thesisDateAccepted>--</thesisDateAccepted>
    <title language="eng">On the split closure of the periodic timetabling polytope</title>
    <abstract language="eng">The Periodic Event Scheduling Problem (PESP) is the central mathematical tool for periodic timetable optimization in public transport. PESP can be formulated in several ways as a mixed-integer linear program with typically general integer variables. We investigate the split closure of these formulations and show that split inequalities are identical with the recently introduced flip inequalities. While split inequalities are a general mixed-integer programming technique, flip inequalities are defined in purely combinatorial terms, namely cycles and arc sets of the digraph underlying the PESP instance. It is known that flip inequalities can be separated in pseudo-polynomial time. We prove that this is best possible unless P = NP, but also observe that the complexity becomes linear-time if the cycle defining the flip inequality is fixed. Moreover, introducing mixed-integer-compatible maps, we compare the split closures of different formulations, and show that reformulation or binarization by subdivision do not lead to stronger split closures. Finally, we estimate computationally how much of the optimality gap of the instances of the benchmark library PESPlib can be closed exclusively by split cuts, and provide better dual bounds for five instances.</abstract>
    <parentTitle language="eng">Mathematical Programming</parentTitle>
    <identifier type="doi">10.1007/s10107-025-02220-5</identifier>
    <identifier type="issn">0025-5610</identifier>
    <enrichment key="opus_doi_flag">true</enrichment>
    <enrichment key="opus_doi_json">{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T11:10:05Z","timestamp":1744715405919,"version":"3.40.4"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","license":[{"start":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T00:00:00Z","timestamp":1744675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T00:00:00Z","timestamp":1744675200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["EXC-2046\/1","project ID: 390685689"],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"abstract":"&lt;jats:title&gt;Abstract&lt;\/jats:title&gt;\n          &lt;jats:p&gt;The Periodic Event Scheduling Problem (PESP) is the central mathematical tool for periodic timetable optimization in public transport. PESP can be formulated in several ways as a mixed-integer linear program with typically general integer variables. We investigate the split closure of these formulations and show that split inequalities are identical with the recently introduced flip inequalities. While split inequalities are a general mixed-integer programming technique, flip inequalities are defined in purely combinatorial terms, namely cycles and arc sets of the digraph underlying the PESP instance. It is known that flip inequalities can be separated in pseudo-polynomial time. We prove that this is best possible unless &lt;jats:inline-formula&gt;\n              &lt;jats:alternatives&gt;\n                &lt;jats:tex-math&gt;$$\\hbox {P}=\\hbox {NP}$$&lt;\/jats:tex-math&gt;\n                &lt;mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"&gt;\n                  &lt;mml:mrow&gt;\n                    &lt;mml:mtext&gt;P&lt;\/mml:mtext&gt;\n                    &lt;mml:mo&gt;=&lt;\/mml:mo&gt;\n                    &lt;mml:mtext&gt;NP&lt;\/mml:mtext&gt;\n                  &lt;\/mml:mrow&gt;\n                &lt;\/mml:math&gt;\n              &lt;\/jats:alternatives&gt;\n            &lt;\/jats:inline-formula&gt;, but also observe that the complexity becomes linear-time if the cycle defining the flip inequality is fixed. Moreover, introducing mixed-integer-compatible maps, we compare the split closures of different formulations, and show that reformulation or binarization by subdivision do not lead to stronger split closures. Finally, we estimate computationally how much of the optimality gap of the instances of the benchmark library PESPlib can be closed exclusively by split cuts, and provide better dual bounds for five instances.&lt;\/jats:p&gt;","DOI":"10.1007\/s10107-025-02220-5","type":"journal-article","created":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T10:30:06Z","timestamp":1744713006000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the split closure of the periodic timetabling polytope"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8337-4387","authenticated-orcid":false,"given":"Niels","family":"Lindner","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7201-2412","authenticated-orcid":false,"given":"Berenike","family":"Masing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,15]]},"reference":[{"issue":"1","key":"2220_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009). https:\/\/doi.org\/10.1007\/s12532-008-0001-1","journal-title":"Math. Program. Comput."},{"key":"2220_CR2","unstructured":"Aprile, M., Conforti, M., Di\u00a0Summa, M.: Binary extended formulations and sequential convexification (2021). arXiv:2106.00354 [cs, math]"},{"issue":"2","key":"2220_CR3","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-006-0049-5","volume":"113","author":"E Balas","year":"2008","unstructured":"Balas, E., Saxena, A.: Optimizing over the split closure. Math. Program. 113(2), 219\u2013240 (2008). https:\/\/doi.org\/10.1007\/s10107-006-0049-5","journal-title":"Math. Program."},{"issue":"1","key":"2220_CR4","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1), 295\u2013324 (1993). https:\/\/doi.org\/10.1007\/BF01581273","journal-title":"Math. Program."},{"key":"2220_CR5","unstructured":"Bestuzheva, K., Besan\u00e7on, M., Chen, W.-K., Chmiela, A., Donkiewicz, T., Doornmalen, J.v., Eifler, L., Gaul, O., Gamrath, G., Gleixner, A., Gottwald, L., Graczyk, C., Halbig, K., Hoen, A., Hojny, C., Hulst, R.v.d., Koch, T., L\u00fcbbecke, M., Maher, S.J., Matter, F., M\u00fchmer, E., M\u00fcller, B., Pfetsch, M.E., Rehfeldt, D., Schlein, S., Schl\u00f6sser, F., Serrano, F., Shinano, Y., Sofranac, B., Turner, M., Vigerske, S., Wegscheider, F., Wellner, P., Weninger, D., Witzig, J.: The SCIP Optimization Suite 8.0. ZIB-Report 21-41. Zuse Institute, Berlin (2021). http:\/\/nbn-resolving.de\/urn:nbn:de:0297-zib-85309"},{"issue":"2","key":"2220_CR6","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s12532-012-0037-0","volume":"4","author":"P Bonami","year":"2012","unstructured":"Bonami, P.: On optimizing over lift-and-project closures. Math. Program. Comput. 4(2), 151\u2013179 (2012). https:\/\/doi.org\/10.1007\/s12532-012-0037-0","journal-title":"Math. Program. Comput."},{"key":"2220_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2019.100552","volume":"35","author":"R Bornd\u00f6rfer","year":"2020","unstructured":"Bornd\u00f6rfer, R., Hoppmann, H., Karbstein, M., Lindner, N.: Separation of cycle inequalities in periodic timetabling. Discret. Optim. 35, 100552 (2020). https:\/\/doi.org\/10.1016\/j.disopt.2019.100552","journal-title":"Discret. Optim."},{"key":"2220_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jrtpm.2019.100175","volume":"15","author":"R Bornd\u00f6rfer","year":"2020","unstructured":"Bornd\u00f6rfer, R., Lindner, N., Roth, S.: A concurrent approach to the periodic event scheduling problem. J. Rail Transp. Plann. Manage. 15, 100175 (2020). https:\/\/doi.org\/10.1016\/j.jrtpm.2019.100175","journal-title":"J. Rail Transp. Plann. Manage."},{"issue":"2","key":"2220_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10107-002-0320-3","volume":"94","author":"A Caprara","year":"2003","unstructured":"Caprara, A., Letchford, A.N.: On the separation of split cuts and related inequalities. Math. Program. 94(2), 279\u2013294 (2003). https:\/\/doi.org\/10.1007\/s10107-002-0320-3. (ISSN 1436-4646)","journal-title":"Math. Program."},{"key":"2220_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-540-68279-0_11","volume-title":"50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art","author":"M Conforti","year":"2010","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Polyhedral approaches to mixed integer linear programming. In: J\u00fcnger, M., Liebling, T.M., Naddef, D., Nemhauser, G.L., Pulleyblank, W.R., Reinelt, G., Rinaldi, G., Wolsey, L.A. (eds.) 50 Years of Integer Programming 1958\u20132008: From the Early Years to the State-of-the-Art, pp. 343\u2013385. Springer, Berlin (2010). https:\/\/doi.org\/10.1007\/978-3-540-68279-0_11 . (ISBN 978-3-540-68279-0)"},{"key":"2220_CR11","doi-asserted-by":"publisher","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, volume 271 of Graduate Texts in Mathematics. Springer International Publishing, Cham, (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"1","key":"2220_CR12","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF01580858","volume":"47","author":"W Cook","year":"1990","unstructured":"Cook, W., Kannan, R., Schrijver, A.: Chv\u00e1tal closures for mixed integer programming problems. Math. Program. 47(1), 155\u2013174 (1990). https:\/\/doi.org\/10.1007\/BF01580858. (ISSN 1436-4646)","journal-title":"Math. Program."},{"issue":"1","key":"2220_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28(1), 1\u20138 (2001). https:\/\/doi.org\/10.1016\/S0167-6377(00)00067-5. (ISSN 01676377)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"2220_CR14","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s10107-018-1294-0","volume":"170","author":"S Dash","year":"2018","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Hildebrand, R.: Binary extended formulations of polyhedral mixed-integer sets. Math. Program. 170(1), 207\u2013236 (2018). https:\/\/doi.org\/10.1007\/s10107-018-1294-0. (ISSN 1436-4646)","journal-title":"Math. Program."},{"key":"2220_CR15","unstructured":"Goerigk, M.: PESPlib\u2014A benchmark library for periodic event scheduling (2022). http:\/\/num.math.uni-goettingen.de\/~m.goerigk\/pesplib\/. Last update on 11\/07\/2022"},{"key":"2220_CR16","doi-asserted-by":"publisher","unstructured":"Goerigk, M., Liebchen, C.: An improved algorithm for the periodic timetabling problem. In: D\u2019Angelo, G., Dollevoet, T. (eds), 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017), volume\u00a059 of OpenAccess Series in Informatics (OASIcs), pp. 12:1\u201312:14. Dagstuhl, Germany (2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2017.12","DOI":"10.4230\/OASIcs.ATMOS.2017.12"},{"key":"2220_CR17","doi-asserted-by":"publisher","unstructured":"Gro\u00dfmann, P., H\u00f6lldobler, S., Manthey, N., Nachtigall, K., Opitz, J., Steinke, P.: Solving periodic event scheduling problems with SAT. In: Jiang, H., Ding, H., Ali, M., Wu, X. (eds), Advanced Research in Applied Artificial Intelligence, Lecture Notes in Computer Science, pp. 166\u2013175. Springer, Berlin. https:\/\/doi.org\/10.1007\/978-3-642-31087-4_18","DOI":"10.1007\/978-3-642-31087-4_18"},{"key":"2220_CR18","unstructured":"Gurobi Optimization, LLC: Gurobi Optimizer Reference Manual (2023). https:\/\/www.gurobi.com"},{"issue":"4","key":"2220_CR19","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.cosrev.2009.08.001","volume":"3","author":"T Kavitha","year":"2009","unstructured":"Kavitha, T., Liebchen, C., Mehlhorn, K., Michail, D., Rizzi, R., Ueckerdt, T., Zweig, K.A.: Cycle bases in graphs characterization, algorithms, complexity, and applications. Comput. Sci. Rev. 3(4), 199\u2013243 (2009). https:\/\/doi.org\/10.1016\/j.cosrev.2009.08.001. (ISSN 1574-0137)","journal-title":"Comput. Sci. Rev."},{"issue":"1","key":"2220_CR20","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1287\/inte.1080.0409","volume":"39","author":"L Kroon","year":"2009","unstructured":"Kroon, L., Huisman, D., Abbink, E., Fioole, P.-J., Fischetti, M., Mar\u00f3ti, G., Schrijver, A., Steenbeek, A., Ybema, R.: The new Dutch timetable: the OR revolution. Interfaces 39(1), 6\u201317 (2009). https:\/\/doi.org\/10.1287\/inte.1080.0409. (ISSN 0092-2102, 1526-551X)","journal-title":"Interfaces"},{"key":"2220_CR21","unstructured":"Liebchen, C.: Periodic Timetable Optimization in Public Transport. PhD thesis, Technische Universit\u00e4t, Berlin (2006)"},{"issue":"4","key":"2220_CR22","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1287\/trsc.1080.0240","volume":"42","author":"C Liebchen","year":"2008","unstructured":"Liebchen, C.: The first optimized railway timetable in practice. Transp. Sci. 42(4), 420\u2013435 (2008). https:\/\/doi.org\/10.1287\/trsc.1080.0240. (ISSN 0041-1655, Publisher: INFORMS)","journal-title":"Transp. Sci."},{"key":"2220_CR23","doi-asserted-by":"publisher","unstructured":"Liebchen, C., M\u00f6hring, R.H.: The modeling power of the periodic event scheduling problem: railway timetables\u2014and beyond. In: Geraets, F., Kroon, L., Schoebel, A., Wagner, D., Zaroliagis, C.D. (eds) Algorithmic Methods for Railway Optimization, Lecture Notes in Computer Science, pp. 3\u201340, Springer, Berlin (2007). https:\/\/doi.org\/10.1007\/978-3-540-74247-0_1","DOI":"10.1007\/978-3-540-74247-0_1"},{"issue":"1","key":"2220_CR24","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.disopt.2008.09.003","volume":"6","author":"C Liebchen","year":"2009","unstructured":"Liebchen, C., Peeters, L.: Integral cycle bases for cyclic timetabling. Discret. Optim. 6(1), 98\u2013109 (2009). https:\/\/doi.org\/10.1016\/j.disopt.2008.09.003. (ISSN 1572-5286)","journal-title":"Discret. Optim."},{"key":"2220_CR25","doi-asserted-by":"publisher","unstructured":"Liebchen, C., Swarat, E.: The second Chvatal closure can yield better railway timetables. In: Fischetti, M., Widmayer, P. (eds), 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201908), volume\u00a09 of OpenAccess Series in Informatics (OASIcs), Dagstuhl, Germany (2008). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2008.1580","DOI":"10.4230\/OASIcs.ATMOS.2008.1580"},{"key":"2220_CR26","doi-asserted-by":"publisher","unstructured":"Lindner, N., Liebchen, C.: Determining all integer vertices of the PESP polytope by flipping arcs. In: Huisman, D., Zaroliagis, C.D. (eds), 20th Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2020), volume\u00a085 of OpenAccess Series in Informatics (OASIcs), pp. 5:1\u20135:18. Dagstuhl, Germany (2020). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2020.5","DOI":"10.4230\/OASIcs.ATMOS.2020.5"},{"key":"2220_CR27","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejtl.2022.100081","volume":"11","author":"N Lindner","year":"2022","unstructured":"Lindner, N., Liebchen, C.: Timetable merging for the periodic event scheduling problem. EURO J. Transp. Logist. 11, 100081 (2022). https:\/\/doi.org\/10.1016\/j.ejtl.2022.100081. (ISSN 2192-4376)","journal-title":"EURO J. Transp. Logist."},{"issue":"2","key":"2220_CR28","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s10951-021-00719-1","volume":"25","author":"N Lindner","year":"2022","unstructured":"Lindner, N., Reisch, J.: An analysis of the parameterized complexity of periodic timetabling. J. Sched. 25(2), 157\u2013176 (2022). https:\/\/doi.org\/10.1007\/s10951-021-00719-1. (ISSN 1094-6136)","journal-title":"J. Sched."},{"key":"2220_CR29","doi-asserted-by":"publisher","unstructured":"Lindner, N., Liebchen, C., Masing, B.: Forward cycle bases and periodic timetabling. In: M\u00fcller-Hannemann, M., Perea, F. (eds), 21st Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2021), volume\u00a096 of Open Access Series in Informatics (OASIcs), pp. 2:1\u20132:14. Dagstuhl, Germany (2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2021.2","DOI":"10.4230\/OASIcs.ATMOS.2021.2"},{"key":"2220_CR30","unstructured":"Lindner, T.: Train Scheduling in Public Rail Transport. PhD thesis, Technische Universit\u00e4t Braunschweig (2000)"},{"key":"2220_CR31","unstructured":"Masing, B., Lindner, N., Ebert, P.: Forward and Line-Based Cycle Bases for Periodic Timetabling. ZIB-Report 23-05, Zuse Institute, Berlin (2023). https:\/\/nbn-resolving.org\/urn:nbn:de:0297-zib-89731"},{"key":"2220_CR32","unstructured":"Nachtigall, K.: Cutting Planes for a Polyhedron Associated with a Periodic Network. Technical Report IB 112-96\/17, Deutsches Zentrum f\u00fcr Luft- und Raumfahrt E. V. (1996)"},{"key":"2220_CR33","unstructured":"Nachtigall, K.: Periodic Network Optimization and Fixed Interval Timetables. Habilitation Thesis, Universit\u00e4t Hildesheim (1998)"},{"key":"2220_CR34","doi-asserted-by":"publisher","unstructured":"Nachtigall, K., Opitz, J.: Solving periodic timetable optimisation problems by modulo simplex calculations. In: Fischetti, M., Widmayer, P. (eds), 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS\u201908), volume\u00a09 of OpenAccess Series in Informatics (OASIcs), Dagstuhl, Germany (2008). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2008.1588","DOI":"10.4230\/OASIcs.ATMOS.2008.1588"},{"issue":"1","key":"2220_CR35","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01585752","volume":"46","author":"GL Nemhauser","year":"1990","unstructured":"Nemhauser, G.L., Wolsey, L.A.: A recursive procedure to generate all cuts for 0\u20131 mixed integer programs. Math. Program. 46(1), 379\u2013390 (1990). https:\/\/doi.org\/10.1007\/BF01585752. (ISSN 1436-4646)","journal-title":"Math. Program."},{"key":"2220_CR36","unstructured":"Odijk, M.A.: Construction of Periodic Timetables, Part 1: A Cutting Plane Algorithm. Technical Report 94-61, TU Delft (1994)"},{"key":"2220_CR37","unstructured":"Peeters, L.: Cyclic Railway Timetable Optimization. PhD thesis, Erasmus Universiteit Rotterdam (2003)"},{"key":"2220_CR38","doi-asserted-by":"publisher","unstructured":"P\u00e4tzold, J., Sch\u00f6bel, A.: A matching approach for periodic timetabling. In: Goerigk, M., Werneck, R. (eds), 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016), volume\u00a054 of OpenAccess Series in Informatics (OASIcs), pp. 1:1\u20131:15. Dagstuhl, Germany (2016). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. https:\/\/doi.org\/10.4230\/OASIcs.ATMOS.2016.1","DOI":"10.4230\/OASIcs.ATMOS.2016.1"},{"issue":"6","key":"2220_CR39","doi-asserted-by":"publisher","first-page":"1714","DOI":"10.1287\/trsc.2019.0965","volume":"54","author":"P Schiewe","year":"2020","unstructured":"Schiewe, P., Sch\u00f6bel, A.: Periodic timetabling with integrated routing: toward applicable approaches. Transp. Sci. 54(6), 1714\u20131731 (2020). https:\/\/doi.org\/10.1287\/trsc.2019.0965. (ISSN 0041-1655, Publisher: INFORMS)","journal-title":"Transp. Sci."},{"issue":"4","key":"2220_CR40","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 J. Discret. Math. 2(4), 550\u2013581 (1989). https:\/\/doi.org\/10.1137\/0402049. (ISSN 0895-4801, Publisher: Society for Industrial and Applied Mathematics)","journal-title":"SIAM J. Discret. Math."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02220-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-025-02220-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-025-02220-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,15]],"date-time":"2025-04-15T10:30:12Z","timestamp":1744713012000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-025-02220-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,15]]},"references-count":40,"alternative-id":["2220"],"URL":"https:\/\/doi.org\/10.1007\/s10107-025-02220-5","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,15]]},"assertion":[{"value":"4 June 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 April 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}</enrichment>
    <enrichment key="opus_crossrefDocumentType">journal-article</enrichment>
    <enrichment key="opus_crossrefLicence">https://creativecommons.org/licenses/by/4.0</enrichment>
    <enrichment key="opus_import_origin">crossref</enrichment>
    <enrichment key="opus_doiImportPopulated">PersonAuthorFirstName_1,PersonAuthorLastName_1,PersonAuthorIdentifierOrcid_1,PersonAuthorFirstName_2,PersonAuthorLastName_2,PersonAuthorIdentifierOrcid_2,PublisherName,TitleMain_1,Language,TitleAbstract_1,TitleParent_1,PublishedYear,IdentifierIssn,Enrichmentopus_crossrefLicence</enrichment>
    <enrichment key="PeerReviewed">yes</enrichment>
    <enrichment key="AcceptedDate">2025-02-18</enrichment>
    <enrichment key="opus.source">doi-import</enrichment>
    <enrichment key="PreprintUrn">urn:nbn:de:0297-zib-91156</enrichment>
    <enrichment key="opus.doi.autoCreate">false</enrichment>
    <enrichment key="opus.urn.autoCreate">true</enrichment>
    <author>Niels Lindner</author>
    <submitter>Niels Lindner</submitter>
    <author>Berenike Masing</author>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic event scheduling problem</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Periodic timetabling</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Split closure</value>
    </subject>
    <subject>
      <language>eng</language>
      <type>uncontrolled</type>
      <value>Mixed-integer programming</value>
    </subject>
    <collection role="ccs" number="J.">Computer Applications</collection>
    <collection role="msc" number="90-XX">OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING</collection>
    <collection role="institutes" number="optimization">Mathematical Optimization</collection>
    <collection role="projects" number="MODAL-Gesamt">MODAL-Gesamt</collection>
    <collection role="persons" number="lindner">Lindner, Niels</collection>
    <collection role="institutes" number="neo">Network Optimization</collection>
    <collection role="persons" number="masing">Masing, Berenike</collection>
    <collection role="projects" number="MODAL-MobilityLab">MODAL-MobilityLab</collection>
    <collection role="projects" number="MathPlus-AA3-8">MathPlus-AA3-8</collection>
    <collection role="institutes" number="aopt">Applied Optimization</collection>
  </doc>
</export-example>
