{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T17:05:58Z","timestamp":1771693558201,"version":"3.50.1"},"reference-count":32,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,3,1]],"date-time":"2026-03-01T00:00:00Z","timestamp":1772323200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Rail Transport Planning & Management"],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1016\/j.jrtpm.2026.100569","type":"journal-article","created":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T13:39:02Z","timestamp":1769780342000},"page":"100569","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A MaxSAT model for solving the track maintenance possession problem for the railway network in Germany"],"prefix":"10.1016","volume":"37","author":[{"ORCID":"https:\/\/2.zoppoz.workers.dev:443\/https\/orcid.org\/0000-0002-5620-1093","authenticated-orcid":false,"given":"Julian","family":"Reisch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Gro\u00dfmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Reyk","family":"Wei\u00df","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.jrtpm.2026.100569_b1","article-title":"Loandra in the 2020 maxsat evaluation","author":"Berg","year":"2022","journal-title":"MaxSAT Eval. 2022"},{"key":"10.1016\/j.jrtpm.2026.100569_b2","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.artint.2015.07.001","article-title":"Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability","volume":"244","author":"Berg","year":"2017","journal-title":"Artificial Intelligence","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0004-3702","issn-type":"print"},{"key":"10.1016\/j.jrtpm.2026.100569_b3","series-title":"Proceedings of the Seventeenth International Conference on Artificial Intelligence and Statistics","first-page":"86","article-title":"Learning optimal bounded treewidth Bayesian networks via maximum satisfiability","volume":"vol. 33","author":"Berg","year":"2014"},{"issue":"9","key":"10.1016\/j.jrtpm.2026.100569_b4","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1057\/palgrave.jors.2602085","article-title":"Scheduling preventive railway maintenance activities","volume":"57","author":"Budai","year":"2006","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"10.1016\/j.jrtpm.2026.100569_b5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.ejor.2007.10.040","article-title":"Project selection, scheduling and resource allocation with time dependent returns","volume":"193","author":"Chen","year":"2009","journal-title":"European J. Oper. Res.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0377-2217","issn-type":"print"},{"key":"10.1016\/j.jrtpm.2026.100569_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.cor.2024.106679","article-title":"A MaxSAT approach for solving a new Dynamic Discretization Discovery model for train rescheduling problems","volume":"167","author":"Croella","year":"2024","journal-title":"Comput. Oper. Res.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0305-0548","issn-type":"print"},{"issue":"3","key":"10.1016\/j.jrtpm.2026.100569_b7","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1016\/j.ejor.2019.07.056","article-title":"A satisfiability and workload-based exact method for the resource constrained project scheduling problem with generalized precedence constraints","volume":"289","author":"de Azevedo","year":"2021","journal-title":"European J. Oper. Res.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0377-2217","issn-type":"print"},{"issue":"3","key":"10.1016\/j.jrtpm.2026.100569_b8","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.jrtpm.2013.11.001","article-title":"Maintaining tracks and traffic flow at the same time","volume":"3","author":"Forsgren","year":"2013","journal-title":"J. Rail Transp. Plan. Manag.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/2210-9706","issn-type":"print"},{"key":"10.1016\/j.jrtpm.2026.100569_b9","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"Strong NP-completeness results: Motivation, examples, and implications","volume":"25","author":"Garey","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/j.jrtpm.2026.100569_b10","series-title":"International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems","first-page":"166","article-title":"Solving periodic event scheduling problems with SAT","author":"Gro\u00dfmann","year":"2012"},{"key":"10.1016\/j.jrtpm.2026.100569_b11","series-title":"Principles and Practice of Constraint Programming","isbn-type":"print","doi-asserted-by":"crossref","first-page":"941","DOI":"10.1007\/978-3-642-33558-7_67","article-title":"Reasoning over biological networks using maximum satisfiability","author":"Guerra","year":"2012","ISBN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/isbn\/9783642335587"},{"key":"10.1016\/j.jrtpm.2026.100569_b12","series-title":"Gurobi optimizer reference manual","author":"Gurobi Optimization","year":"2024"},{"issue":"1","key":"10.1016\/j.jrtpm.2026.100569_b13","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/s13676-014-0071-3","article-title":"A railway maintenance scheduling problem with customer costs","volume":"4","author":"Heinicke","year":"2015","journal-title":"EURO J. Transp. Logist.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/2192-4376","issn-type":"print"},{"key":"10.1016\/j.jrtpm.2026.100569_b14","series-title":"An efficient encoding of the at-most-one constraint","author":"H\u00f6lldobler","year":"2013"},{"key":"10.1016\/j.jrtpm.2026.100569_b15","unstructured":"Hyttinen, Antti, Eberhardt, Frederick, J\u00e4rvisalo, Matti, 2014. Constraint-based Causal Discovery: Conflict Resolution with Answer Set Programming. In: Proceedings of the 30th Conference on Uncertainty in Artificial Intelligence. pp. 340\u2013349."},{"key":"10.1016\/j.jrtpm.2026.100569_b16","series-title":"Einf\u00fchrung des getakteten sperrzeitensystems zur strukturellen systemstabilisierung und -beruhigung","author":"InfraGO","year":"2024"},{"issue":"1","key":"10.1016\/j.jrtpm.2026.100569_b17","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1002\/net.21605","article-title":"A railroad maintenance problem solved with a cut and column generation matheuristic","volume":"66","author":"Lannez","year":"2015","journal-title":"Networks"},{"key":"10.1016\/j.jrtpm.2026.100569_b18","doi-asserted-by":"crossref","DOI":"10.1613\/jair.1.14924","article-title":"Iterative train scheduling under disruption with maximum satisfiability","volume":"79","author":"Lemos","year":"2024","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/j.jrtpm.2026.100569_b19","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1016\/j.trpro.2015.09.011","article-title":"Railway infrastructure maintenance - A survey of planning problems and conducted research","volume":"10","author":"Lid\u00e9n","year":"2015","journal-title":"Transp. Res. Procedia"},{"key":"10.1016\/j.jrtpm.2026.100569_b20","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s12469-020-00232-2","article-title":"Coordinating maintenance windows and train traffic: a case study","volume":"12","author":"Lid\u00e9n","year":"2020","journal-title":"Public Transp"},{"key":"10.1016\/j.jrtpm.2026.100569_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.trb.2025.103213","article-title":"A bi-level optimization model for project scheduling and traffic flow routing in railway networks","volume":"196","author":"Lid\u00e9n","year":"2025","journal-title":"Transp. Res. B","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0191-2615","issn-type":"print"},{"issue":"207","key":"10.1016\/j.jrtpm.2026.100569_b22","article-title":"Mathematical modeling analyses for obtaining an optimal railway track maintenance schedule","volume":"23","author":"Oyama","year":"2006","journal-title":"Jpn. J. Ind. Appl. Math."},{"key":"10.1016\/j.jrtpm.2026.100569_b23","unstructured":"Park, James D., 2002. Using Weighted Max-SAT Engines to Solve MPE. In: Proc. 18th Nat\u2019L Conf. Artificial Intelligence. pp. 682\u2013687."},{"key":"10.1016\/j.jrtpm.2026.100569_b24","series-title":"Track Maintenance Scheduling and Its Interactions With Operations: Dedicated and Mixed High-Speed Rail (HSR) Scenarios","first-page":"317","volume":"vol. 2","author":"Pouryousef","year":"2010"},{"key":"10.1016\/j.jrtpm.2026.100569_b25","series-title":"Tagungsbericht Heureka 2024","article-title":"Eine potenzialabsch\u00e4tzung zur reduktion der von baustellen betroffenen zugfahrten","author":"Reisch","year":"2024"},{"key":"10.1016\/j.jrtpm.2026.100569_b26","series-title":"Chronopath","author":"Reisch","year":"2022"},{"issue":"4","key":"10.1016\/j.jrtpm.2026.100569_b27","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1061\/(ASCE)IS.1943-555X.0000081","article-title":"Heuristic analysis of the effective range of a track tamping machine","volume":"18","author":"Santos","year":"2012","journal-title":"J. Infrastruct. Syst."},{"key":"10.1016\/j.jrtpm.2026.100569_b28","doi-asserted-by":"crossref","DOI":"10.1016\/j.ress.2021.107827","article-title":"A taxonomy of railway track maintenance planning and scheduling: A review and research trends","volume":"215","author":"Sedghi","year":"2021","journal-title":"Reliab. Eng. Syst. Saf.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0951-8320","issn-type":"print"},{"issue":"3","key":"10.1016\/j.jrtpm.2026.100569_b29","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/j.ejor.2024.02.041","article-title":"A genetic algorithm for the resource-constrained project scheduling problem with alternative subgraphs using a boolean satisfiability solver","volume":"316","author":"Servranckx","year":"2024","journal-title":"European J. Oper. Res.","ISSN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/issn\/0377-2217","issn-type":"print"},{"key":"10.1016\/j.jrtpm.2026.100569_b30","series-title":"Computer Aided Verification","isbn-type":"print","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-319-63387-9_4","article-title":"Maximum satisfiability in software analysis: Applications and techniques","author":"Si","year":"2017","ISBN":"https:\/\/2.zoppoz.workers.dev:443\/https\/id.crossref.org\/isbn\/9783319633879"},{"key":"10.1016\/j.jrtpm.2026.100569_b31","series-title":"Bahn-fahrpl\u00e4ne per lotterie?","author":"Tagesschau","year":"2024"},{"issue":"1","key":"10.1016\/j.jrtpm.2026.100569_b32","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1061\/(ASCE)TE.1943-5436.0000296","article-title":"Integer programming to optimize tamping in railway tracks as preventive maintenance","volume":"138","author":"Vale","year":"2012","journal-title":"J. Transp. Eng."}],"container-title":["Journal of Rail Transport Planning & Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S221097062600003X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/api.elsevier.com\/content\/article\/PII:S221097062600003X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T16:21:22Z","timestamp":1771690882000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/linkinghub.elsevier.com\/retrieve\/pii\/S221097062600003X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3]]},"references-count":32,"alternative-id":["S221097062600003X"],"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jrtpm.2026.100569","relation":{},"ISSN":["2210-9706"],"issn-type":[{"value":"2210-9706","type":"print"}],"subject":[],"published":{"date-parts":[[2026,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A MaxSAT model for solving the track maintenance possession problem for the railway network in Germany","name":"articletitle","label":"Article Title"},{"value":"Journal of Rail Transport Planning & Management","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1016\/j.jrtpm.2026.100569","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100569"}}