{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T05:22:55Z","timestamp":1767331375316,"version":"3.48.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032135889","type":"print"},{"value":"9783032135896","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-13589-6_20","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T05:21:55Z","timestamp":1767331315000},"page":"267-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Addressing Classic Constraint Satisfaction Problems Through Optimisation Modulo Theories"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-1219-9136","authenticated-orcid":false,"given":"Ignacio","family":"Jorquera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8264-8534","authenticated-orcid":false,"given":"Nicol\u00e1s","family":"G\u00e1lvez Ram\u00edrez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8227-7174","authenticated-orcid":false,"given":"Frederic","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7970-1368","authenticated-orcid":false,"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4149-7730","authenticated-orcid":false,"given":"Carlos","family":"Castro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,3]]},"reference":[{"key":"20_CR1","unstructured":"CSPLib: A problem library for constraints (1999). http:\/\/www.csplib.org"},{"key":"20_CR2","unstructured":"Barrett, C., Fontaine, P., Tinelli, C.: The SMT-LIB standard: version 2.6 (2017). www.SMT-LIB.org"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Benjamin\u00a0Mikek, Q.Z.: Speeding up SMT solving via compiler optimization. In: Proceedings of the Symposium on Foundations of Software Engineering (FSE) (2023)","DOI":"10.1145\/3611643.3616357"},{"key":"20_CR4","doi-asserted-by":"publisher","unstructured":"Bofill, M., Coll, J., Nightingale, P., Suy, J., Ulrich-Oltean, F., Villaret, M.: SAT encodings for pseudo-Boolean constraints together with at-most-one constraints. Artif. Intell. 302, 103604 (2022). https:\/\/doi.org\/10.1016\/J.ARTINT.2021.103604","DOI":"10.1016\/J.ARTINT.2021.103604"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Bofill, M., Coll, J., Suy, J., Villaret, M.: SMT encodings for resource constrained project scheduling problems. Comput. Industr. Eng. 149, 106777 (2020). https:\/\/doi.org\/10.1016\/j.cie.2020.106777, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0360835220304873","DOI":"10.1016\/j.cie.2020.106777"},{"key":"20_CR6","unstructured":"Bofill, M., Palah\u2019i, M., Suy, J., Villaret, M.: Simply: a compiler from a CSP modeling language to the SMT-LIB format, pp. 30\u201344 (2009)"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s10601-012-9123-1","volume":"17","author":"M Bofill","year":"2012","unstructured":"Bofill, M., Suy, J., Palah\u00ed, M., Villaret, M.: Solving constraint satisfaction problems with sat modulo theories. Constraints 17, 273\u2013303 (2012). https:\/\/doi.org\/10.1007\/s10601-012-9123-1","journal-title":"Constraints"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1007\/978-3-642-14186-7_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"M Bofill","year":"2010","unstructured":"Bofill, M., Suy, J., Villaret, M.: A system for solving constraint satisfaction problems with SMT. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 300\u2013305. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_25"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-58475-7_9","volume-title":"Principles and Practice of Constraint Programming","author":"E Davidson","year":"2020","unstructured":"Davidson, E., Akg\u00fcn, \u00d6., Espasa, J., Nightingale, P.: Effective encodings of constraint programming models to SMT. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 143\u2013159. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_9"},{"key":"20_CR10","unstructured":"Gawlitza, T., Monniaux, D.: Improving strategies via SMT solving. CoRR abs\/1101.2812 (2011). http:\/\/arxiv.org\/abs\/1101.2812"},{"key":"20_CR11","doi-asserted-by":"publisher","unstructured":"G\u00e1lvez Ram\u00edrez, N., Monfroy, E., Saubion, F., Castro, C.: Improving complex SMT strategies with learning. Int. Trans. Oper. Res. 27(2), 1162\u20131188 (2020). https:\/\/doi.org\/10.1111\/itor.12650, https:\/\/onlinelibrary.wiley.com\/doi\/abs\/10.1111\/itor.12650","DOI":"10.1111\/itor.12650"},{"issue":"1\u20134","key":"20_CR12","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1023\/B:ANOR.0000032568.51115.0d","volume":"130","author":"B Hnich","year":"2004","unstructured":"Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Hybrid modelling for robust solving. Ann. Oper. Res. 130(1\u20134), 19\u201339 (2004). https:\/\/doi.org\/10.1023\/B:ANOR.0000032568.51115.0d","journal-title":"Ann. Oper. Res."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Lecoutre, C.: Constraint Networks: Techniques and Algorithms. Wiley-IEEE Press (2009)","DOI":"10.1002\/9780470611821"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"20_CR15","unstructured":"Nightingale, P., Rendl, A.: Essence\u2019 description. CoRR abs\/1601.02865 (2016), http:\/\/arxiv.org\/abs\/1601.02865"},{"key":"20_CR16","unstructured":"Oliver, R.: Optimization modulo theories. Master\u2019s thesis, Universitat Polit\u00e8cnica de Catalunya (2011)"},{"key":"20_CR17","unstructured":"Robinson, J.: On the Hamiltonian game (a traveling salesman problem) (1949)"},{"key":"20_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-030-85248-1_7","volume-title":"Formal Methods for Industrial Critical Systems","author":"J Schmidt","year":"2021","unstructured":"Schmidt, J., Leuschel, M.: Improving SMT solver integrations for the validation of B and event-B models. In: Lluch Lafuente, A., Mavridou, A. (eds.) FMICS 2021. LNCS, vol. 12863, pp. 107\u2013125. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-85248-1_7"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Tack, G., et al.: Minizinc (version 2.8.4). https:\/\/doi.org\/10.5281\/zenodo.10836043 (2024). https:\/\/doi.org\/10.5281\/ZENODO.10836043. Accessed 15 Aug 2024","DOI":"10.5281\/ZENODO.10836043"},{"key":"20_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/3-540-45757-7_26","volume-title":"Logics in Artificial Intelligence","author":"C Tinelli","year":"2002","unstructured":"Tinelli, C.: A DPLL-based calculus for ground satisfiability modulo theories. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 308\u2013319. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45757-7_26"},{"key":"20_CR21","unstructured":"Vanhoucke, M., Maenhout, B.: NSPLib\u2013a nurse scheduling problem library: a tool to evaluate (meta-)heuristic procedures (2007)"},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2000","author":"T Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441\u2013456. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45349-0_32"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-13589-6_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T05:21:56Z","timestamp":1767331316000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-13589-6_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032135889","9783032135896"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-13589-6_20","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"3 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"All authors declare that they have no conflicts of interest following the submitted research.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dubai","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Arab Emirates","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2025.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}