{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T07:52:52Z","timestamp":1774770772833,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JSPS KAKENHI 15K00099"],"award-info":[{"award-number":["JSPS KAKENHI 15K00099"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["JSPS KAKENHI 16H02803"],"award-info":[{"award-number":["JSPS KAKENHI 16H02803"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHA 550\/9-2"],"award-info":[{"award-number":["SCHA 550\/9-2"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SCHA 550\/11-1"],"award-info":[{"award-number":["SCHA 550\/11-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1007\/s10479-018-2757-7","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T12:23:44Z","timestamp":1516623824000},"page":"3-37","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["$${\\varvec{teaspoon}}$$: solving the curriculum-based course timetabling problems with answer set programming"],"prefix":"10.1007","volume":"275","author":[{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-5388-727X","authenticated-orcid":false,"given":"Mutsunori","family":"Banbara","sequence":"first","affiliation":[]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[]},{"given":"Benjamin","family":"Kaufmann","sequence":"additional","affiliation":[]},{"given":"Tenda","family":"Okimoto","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-7456-041X","authenticated-orcid":false,"given":"Torsten","family":"Schaub","sequence":"additional","affiliation":[]},{"given":"Takehide","family":"Soh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/linproxy.fan.workers.dev:443\/https\/orcid.org\/0000-0002-5466-1010","authenticated-orcid":false,"given":"Naoyuki","family":"Tamura","sequence":"additional","affiliation":[]},{"given":"Philipp","family":"Wanko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,22]]},"reference":[{"issue":"1","key":"2757_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10732-010-9154-y","volume":"18","author":"S Abdullah","year":"2012","unstructured":"Abdullah, S., Turabieh, H., McCollum, B., & McMullan, P. (2012). A hybrid metaheuristic approach to the university course timetabling problem. Journal of Heuristics, 18(1), 1\u201323.","journal-title":"Journal of Heuristics"},{"key":"2757_CR2","first-page":"1","volume":"218","author":"RA Ach\u00e1","year":"2012","unstructured":"Ach\u00e1, R. A., & Nieuwenhuis, R. (2012). Curriculum-based course timetabling with SAT and MaxSAT. Annals of Operations Research, 218, 1\u201321.","journal-title":"Annals of Operations Research"},{"key":"2757_CR3","unstructured":"Andres, B., Kaufmann, B., Matheis, O., & Schaub T. (2012). Unsatisfiability-based optimization in clasp. In: A. Dovier & V. Santos Costa (Eds.), Technical communications of the twenty-eighth international conference on logic programming (ICLP\u201912), Leibniz international proceedings in informatics (LIPIcs) (Vol.\u00a017, pp. 212\u2013221)."},{"key":"2757_CR4","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.artint.2013.01.002","volume":"196","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bonet, M., & Levy, J. (2013). SAT-based MaxSAT algorithms. Artificial Intelligence, 196, 77\u2013105.","journal-title":"Artificial Intelligence"},{"issue":"4\u20135","key":"2757_CR5","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1017\/S1471068413000495","volume":"13","author":"M Banbara","year":"2013","unstructured":"Banbara, M., Soh, T., Tamura, N., Inoue, K., & Schaub, T. (2013). Answer set programming as a modeling language for course timetabling. Theory and Practice of Logic Programming, 13(4\u20135), 783\u2013798.","journal-title":"Theory and Practice of Logic Programming"},{"key":"2757_CR6","unstructured":"Banbara, M., Inoue, K., Kaufmann, B., Schaub, T., Soh, T., Tamura, N., et al. (2016). teaspoon: Solving the curriculum-based course timetabling problems with answer set programming. In: E. K. Burke, L. Di Gaspero, E. \u00d6zcan, B. McCollum, & A. Schaerf (Eds.), Proceedings of the 11th international conference on the practice and theory of automated timetabling (PATAT\u201916) (pp. 13\u201332)."},{"key":"2757_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543357","volume-title":"Knowledge representation, reasoning and declarative problem solving","author":"C Baral","year":"2003","unstructured":"Baral, C. (2003). Knowledge representation, reasoning and declarative problem solving. Cambridge: Cambridge University Press."},{"key":"2757_CR8","doi-asserted-by":"crossref","unstructured":"Bart\u00e1k, R., M\u00fcller, T., & Rudov\u00e1, H. (2004). A new approach to modeling and solving minimal perturbation problems. In K. R. Apt, F. Fages, F. Rossi, P. Szeredi, & J. V\u00e1ncza (Eds.), Recent advances in constraints, joint ERCIM\/CoLogNET international workshop on constraint solving and constraint logic programming (CSCLP\u201903) (Vol. 3010, pp. 233\u2013249). Springer, LNCS.","DOI":"10.1007\/978-3-540-24662-6_13"},{"issue":"2","key":"2757_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11750-015-0366-z","volume":"23","author":"A Bettinelli","year":"2015","unstructured":"Bettinelli, A., Cacchiani, V., Roberti, R., & Paolo, Toth. (2015). An overview of curriculum-based course timetabling. TOP, 23(2), 313\u2013349.","journal-title":"TOP"},{"key":"2757_CR10","volume-title":"Handbook of satisfiability, frontiers in artificial intelligence and applications","year":"2009","unstructured":"Biere, A., Heule, M., van Maaren, H., & Walsh, T. (Eds.). (2009). Handbook of satisfiability, frontiers in artificial intelligence and applications (Vol. 185). Clifton: IOS Press."},{"issue":"1","key":"2757_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s10479-010-0707-0","volume":"194","author":"A Bonutti","year":"2012","unstructured":"Bonutti, A., De Cesco, F., Di Gaspero, L., & Schaerf, A. (2012). Benchmarking curriculum-based course timetabling: Formulations, data formats, instances, validation, visualization, and results. Annals of Operations Research, 194(1), 59\u201370.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2757_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/S0377-2217(02)00069-3","volume":"140","author":"EK Burke","year":"2002","unstructured":"Burke, E. K., & Petrovic, S. (2002). Recent research directions in automated timetabling. European Journal of Operational Research, 140(2), 266\u2013280.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2757_CR13","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1016\/j.cor.2009.02.023","volume":"37","author":"EK Burke","year":"2010","unstructured":"Burke, E. K., Marecek, J., Parkes, A. J., & Rudov\u00e1, H. (2010a). Decomposition, reformulation, and diving in university course timetabling. Computers & Operations Research, 37(3), 582\u2013597.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"2757_CR14","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","volume":"179","author":"EK Burke","year":"2010","unstructured":"Burke, E. K., Marecek, J., Parkes, A. J., & Rudov\u00e1, H. (2010b). A supernodal formulation of vertex colouring with applications in course timetabling. Annals of Operations Research, 179(1), 105\u2013130.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2757_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-010-0828-5","volume":"194","author":"EK Burke","year":"2012","unstructured":"Burke, E. K., Marecek, J., Parkes, A. J., & Rudov\u00e1, H. (2012). A branch-and-cut procedure for the Udine course timetabling problem. Annals of Operations Research, 194(1), 71\u201387.","journal-title":"Annals of Operations Research"},{"key":"2757_CR16","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.cor.2016.08.004","volume":"78","author":"E Demirovic","year":"2017","unstructured":"Demirovic, E., & Musliu, N. (2017). MaxSAT-based large neighborhood search for high school timetabling. Computers & OR, 78, 172\u2013180.","journal-title":"Computers & OR"},{"key":"2757_CR17","unstructured":"Di Gaspero, L., & Schaerf, A. (2003). Multi-neighbourhood local search with application to course timetabling. In E. K. Burke & P. D. Causmaecker (Eds.) Proceedings of the 4th international conference on the practice and theory of automated timetabling (PATAT\u201902) (Vol. 2740, pp. 262\u2013275). Berlin: Springer, LNCS."},{"issue":"1","key":"2757_CR18","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L Di Gaspero","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 5(1), 65\u201389.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"2757_CR19","unstructured":"Di Gaspero, L., McCollum, B., & Schaerf, A. (2007). The second international timetabling competition (ITC-2007): Curriculum-based course timetabling (track 3). Technical report, Queen\u2019s University, Belfast, United Kingdom"},{"issue":"4","key":"2757_CR20","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., & S\u00f6rensson, N. (2003). Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science, 89(4), 543\u2013560.","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"2757_CR21","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria Optimization. Berlin: Springer."},{"issue":"3","key":"2757_CR22","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","volume":"37","author":"E Erdem","year":"2016","unstructured":"Erdem, E., Gelfond, M., & Leone, N. (2016). Applications of ASP. AI Magazine, 37(3), 53\u201368.","journal-title":"AI Magazine"},{"key":"2757_CR23","unstructured":"Faber, W., Leone, N., & Pfeifer, G. (1998). Representing school timetabling in a disjunctive logic programming language. In U. Egly & H. Tompits (Eds.), Proceedings of the 13th workshop on logic programming (WLP\u201998) (pp. 43\u201352)."},{"key":"2757_CR24","volume-title":"Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning","author":"M Gebser","year":"2012","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., & Schaub, T. (2012). Answer set solving in practice. Synthesis lectures on artificial intelligence and machine learning. San Rafael: Morgan and Claypool Publishers."},{"key":"2757_CR25","unstructured":"Gebser, M., Kaufmann, B., Otero, R., Romero, J., Schaub, T., & Wanko P. (2013). Domain-specific heuristics in answer set programming. In: M. desJardins & M. Littman (Eds.), Proceedings of the twenty-seventh national conference on artificial intelligence (AAAI\u201913) (pp. 350\u2013356). AAAI Press."},{"key":"2757_CR26","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Romero, J., & Schaub, T. (2015a). Progress in clasp series 3. In F. Calimeri, G. Ianni, & M. Truszczy\u0144ski (eds) Proceedings of the thirteenth international conference on logic programming and nonmonotonic reasoning (LPNMR\u201915) (Vol. 9345, pp. 368\u2013383). Springe, LNAI.","DOI":"10.1007\/978-3-319-23264-5_31"},{"key":"2757_CR27","doi-asserted-by":"crossref","unstructured":"Gebser, M., Kaminski, R., Obermeier, P., & Schaub, T. (2015b). Ricochet robots reloaded: A case-study in multi-shot ASP solving. In: T. Eiter, H. Strass, M. Truszczy\u0144ski, & S. Woltran (Eds.), Advances in knowledge representation, logic programming, and abstract argumentation: Essays dedicated to Gerhard Brewka on the occasion of his 60th birthday (Vol. 9060, pp. 17\u201332). Springer, LNAI.","DOI":"10.1007\/978-3-319-14726-0_2"},{"issue":"1","key":"2757_CR28","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10479-010-0703-4","volume":"194","author":"MJ Geiger","year":"2012","unstructured":"Geiger, M. J. (2012). Applying the threshold accepting metaheuristic to curriculum based course timetabling\u2014A contribution to the second international timetabling competition ITC 2007. Annals of Operations Research, 194(1), 189\u2013202.","journal-title":"Annals of Operations Research"},{"key":"2757_CR29","unstructured":"Gelfond, M, & Lifschitz, V. (1988). The stable model semantics for logic programming. In Proceedings of the fifth international conference and symposium on logic programming (pp. 1070\u20131080). MIT Press."},{"key":"2757_CR30","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H., & Leyton-Brown, K. (2011). Sequential model-based optimization for general algorithm configuration. In Proceedings of the fifth international conference on learning and intelligent optimization (LION\u201911) (Vol. 6683, pp. 507\u2013523). Springer, LNCS.","DOI":"10.1007\/978-3-642-25566-3_40"},{"issue":"1","key":"2757_CR31","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10479-010-0700-7","volume":"194","author":"G Lach","year":"2012","unstructured":"Lach, G., & L\u00fcbbecke, M. E. (2012). Curriculum based course timetabling: New solutions to Udine benchmark instances. Annals of Operations Research, 194(1), 255\u2013272.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2757_CR32","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00291-007-0097-0","volume":"30","author":"R Lewis","year":"2007","unstructured":"Lewis, R. (2007). A survey of metaheuristic-based techniques for university timetabling problems. OR Spectrum, 30(1), 167\u2013190.","journal-title":"OR Spectrum"},{"issue":"1","key":"2757_CR33","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.ejor.2008.12.007","volume":"200","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., & Hao, J. K. (2010). Adaptive tabu search for course timetabling. European Journal of Operational Research, 200(1), 235\u2013244.","journal-title":"European Journal of Operational Research"},{"issue":"6","key":"2757_CR34","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s00158-003-0368-6","volume":"26","author":"R Marler","year":"2004","unstructured":"Marler, R., & Arora, J. (2004). Survey of multi-objective optimization methods for engineering. Structural and Multidisciplinary Optimization, 26(6), 369\u2013395.","journal-title":"Structural and Multidisciplinary Optimization"},{"key":"2757_CR35","unstructured":"Marques-Silva, J., & Planes, J. (2007). On using unsatisfiability for solving maximum satisfiability. CoRR abs\/0712.1097"},{"key":"2757_CR36","doi-asserted-by":"crossref","unstructured":"McCollum, B. (2007). A perspective on bridging the gap between theory and practice in university timetabling. In EK Burke, & H Rudov\u00e1 (Eds.), Proceedings of the 6th international conference on the practice and theory of automated timetabling (PATAT\u201906) (Vol 3867, pp. 3\u201323). Revised Selected Papers, Springer, LNCS.","DOI":"10.1007\/978-3-540-77345-0_1"},{"issue":"1","key":"2757_CR37","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1287\/ijoc.1090.0320","volume":"22","author":"B McCollum","year":"2010","unstructured":"McCollum, B., Schaerf, A., Paechter, B., McMullan, P., Lewis, R., Parkes, A. J., et al. (2010). Setting the research agenda in automated timetabling: The second international timetabling competition. INFORMS Journal on Computing, 22(1), 120\u2013130.","journal-title":"INFORMS Journal on Computing"},{"issue":"1","key":"2757_CR38","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10479-009-0644-y","volume":"172","author":"T M\u00fcller","year":"2009","unstructured":"M\u00fcller, T. (2009). ITC2007 solver description: A hybrid approach. Annals of Operations Research, 172(1), 429\u2013446.","journal-title":"Annals of Operations Research"},{"key":"2757_CR39","doi-asserted-by":"crossref","unstructured":"M\u00fcller, T., Rudov\u00e1, H., & Bart\u00e1k, R. (2005). Minimal perturbation problem in course timetabling. In E. K. Burke, & M. A. Trick (Eds.), Proceedings of the 5th international conference on the practice and theory of automated timetabling (PATAT\u201904) (Vol. 3616, pp. 126\u2013146). Springer, LNCS.","DOI":"10.1007\/11593577_8"},{"key":"2757_CR40","doi-asserted-by":"crossref","unstructured":"Narodytska, N., & Bacchus, F. (2014). Maximum satisfiability using core-guided MaxSAT resolution. In C. Brodley, & P. Stone (Eds.), Proceedings of the twenty-eighth national conference on artificial intelligence (AAAI\u201914) (pp. 2717\u20132723). AAAI Press","DOI":"10.1609\/aaai.v28i1.9124"},{"issue":"3\u20134","key":"2757_CR41","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1018930122475","volume":"25","author":"I Niemel\u00e4","year":"1999","unstructured":"Niemel\u00e4, I. (1999). Logic programs with stable model semantics as a constraint programming paradigm. Ann Mathematics and Artificial Intelligence, 25(3\u20134), 241\u2013273.","journal-title":"Ann Mathematics and Artificial Intelligence"},{"key":"2757_CR42","first-page":"1","volume":"252","author":"AE Phillips","year":"2016","unstructured":"Phillips, A. E., Walker, C. G., Ehrgott, M., & Ryan, D. M. (2016). Integer programming for minimal perturbation problems in university course timetabling. Annals of Operations Research, 252, 1\u201322.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"2757_CR43","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/s10951-010-0171-3","volume":"14","author":"H Rudov\u00e1","year":"2011","unstructured":"Rudov\u00e1, H., M\u00fcller, T., & Murray, K. S. (2011). Complex university course timetabling. Journal of Scheduling, 14(2), 187\u2013207.","journal-title":"Journal of Scheduling"},{"issue":"5","key":"2757_CR44","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1023\/A:1009856210543","volume":"4","author":"HE Sakkout","year":"2000","unstructured":"Sakkout, H. E., & Wallace, M. (2000). Probe backtrack search for minimal perturbation in dynamic scheduling. Constraints, 4(5), 359\u2013388.","journal-title":"Constraints"},{"issue":"2","key":"2757_CR45","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/A:1006576209967","volume":"13","author":"A Schaerf","year":"1999","unstructured":"Schaerf, A. (1999). A survey of automated timetabling. Artificial Intelligence Review, 13(2), 87\u2013127.","journal-title":"Artificial Intelligence Review"},{"key":"2757_CR46","doi-asserted-by":"crossref","unstructured":"Schwind, N., Okimoto, T., Konieczny, S., Wack, M., & Inoue, K. (2014). Utilitarian and egalitarian solutions for multi-objective constraint optimization. In Proceedings of the 26th IEEE international conference on tools with artificial intelligence (ICTAI\u201914), IEEE Computer Society (pp. 170\u2013177).","DOI":"10.1109\/ICTAI.2014.34"},{"key":"2757_CR47","doi-asserted-by":"crossref","unstructured":"Sinz, C. (2005). Towards an optimal CNF encoding of Boolean cardinality constraints. In van Beek, P. (Ed.), Proceedings of the eleventh international conference on principles and practice of constraint programming (CP\u201905) (Vol. 3709, pp. 827\u2013831). Springer, LNCS.","DOI":"10.1007\/11564751_73"},{"key":"2757_CR48","doi-asserted-by":"crossref","unstructured":"Soh, T., Banbara, M., Tamura, N., & Berre, D. L. (2017). Solving multiobjective discrete optimization problems with propositional minimal model generation. In J. C. Beck (Ed.), Proceedings of the 23rd international conference on principles and practice of constraint programming (CP\u201917) (Vol. 10416, pp. 596\u2013614). Springer, LNCS.","DOI":"10.1007\/978-3-319-66158-2_38"},{"issue":"3","key":"2757_CR49","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/s10601-011-9108-5","volume":"16","author":"R Zivan","year":"2011","unstructured":"Zivan, R., Grubshtein, A., & Meisels, A. (2011). Hybrid search for minimal perturbation in dynamic CSPs. Constraints, 16(3), 228\u2013249.","journal-title":"Constraints"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/article\/10.1007\/s10479-018-2757-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2757-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-2757-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T00:11:50Z","timestamp":1660349510000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/http\/link.springer.com\/10.1007\/s10479-018-2757-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,22]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,4]]}},"alternative-id":["2757"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1007\/s10479-018-2757-7","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,22]]},"assertion":[{"value":"22 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}