{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T00:56:35Z","timestamp":1771030595245,"version":"3.50.1"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T00:00:00Z","timestamp":1764547200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2025,12]]},"DOI":"10.1007\/s10601-025-09382-1","type":"journal-article","created":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T09:04:30Z","timestamp":1766394270000},"page":"62-108","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Solving logic-based benders decomposition master problems with constraint programming and domain-independent dynamic programming"],"prefix":"10.1007","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3305-4983","authenticated-orcid":false,"given":"Jiachen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,12,22]]},"reference":[{"issue":"1","key":"9382_CR1","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"JN Hooker","year":"2003","unstructured":"Hooker, J. N., & Ottosson, G. (2003). Logic-based Benders decomposition. Mathematical Programming, 96(1), 33\u201360.","journal-title":"Mathematical Programming"},{"issue":"3","key":"9382_CR2","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"JN Hooker","year":"2007","unstructured":"Hooker, J. N. (2007). Planning and scheduling by logic-based Benders decomposition. Operations Research, 55(3), 588\u2013602.","journal-title":"Operations Research"},{"issue":"2","key":"9382_CR3","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1016\/j.ejor.2022.02.043","volume":"303","author":"F Leutwiler","year":"2022","unstructured":"Leutwiler, F., & Corman, F. (2022). A logic-based Benders decomposition for microscopic railway timetable planning. European Journal of Operational Research, 303(2), 525\u2013540.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"9382_CR4","first-page":"1551","volume":"33","author":"C Guo","year":"2021","unstructured":"Guo, C., Bodur, M., Aleman, D. M., & Urbach, D. R. (2021). Logic-based Benders decomposition and binary decision diagram based approaches for stochastic distributed operating room scheduling. INFORMS Journal on Computing, 33(4), 1551\u20131569.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"9382_CR5","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1016\/j.ejor.2023.07.032","volume":"312","author":"MA Forbes","year":"2024","unstructured":"Forbes, M. A., Harris, M. G., Jansen, H., Van Der Schoot, F. A., & Taimre, T. (2024). Combining optimisation and simulation using logic-based Benders decomposition. European Journal of Operational Research, 312(3), 840\u2013854.","journal-title":"European Journal of Operational Research"},{"key":"9382_CR6","doi-asserted-by":"crossref","unstructured":"Tran, T. T., & Beck, J. C. (2012) Logic-based Benders decomposition for alternative resource scheduling with sequence dependent setups. In: Proceedings of the 20th European Conference on Artificial Intelligence, pp. 774\u2013779","DOI":"10.3233\/978-1-61499-098-7-774"},{"issue":"3","key":"9382_CR7","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1287\/ijoc.2023.1280","volume":"35","author":"M Daryalal","year":"2023","unstructured":"Daryalal, M., Pouya, H., & DeSantis, M. A. (2023). Network migration problem: A hybrid logic-based Benders decomposition approach. INFORMS Journal on Computing, 35(3), 593\u2013613.","journal-title":"INFORMS Journal on Computing"},{"key":"9382_CR8","doi-asserted-by":"crossref","unstructured":"Kuroiwa, R., & Beck, J. C. (2023). Solving domain-independent dynamic programming problems with anytime heuristic search. In: the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 245\u2013253.","DOI":"10.1609\/icaps.v33i1.27201"},{"key":"9382_CR9","unstructured":"Kuroiwa, R., & Beck, J. C. (2024). Domain-independent dynamic programming. arXiv:2401.13883"},{"key":"9382_CR10","doi-asserted-by":"crossref","unstructured":"Kuroiwa, R., & Beck, J. C. (2023). Domain-independent dynamic programming: Generic state space search for combinatorial optimization. In: the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 236\u2013244.","DOI":"10.1609\/icaps.v33i1.27200"},{"key":"9382_CR11","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s00291-016-0433-3","volume":"38","author":"R Esmaeilbeigi","year":"2016","unstructured":"Esmaeilbeigi, R., Naderi, B., & Charkhgard, P. (2016). New formulations for the setup assembly line balancing and scheduling problem. OR Spectrum, 38, 493\u2013518.","journal-title":"OR Spectrum"},{"key":"9382_CR12","doi-asserted-by":"crossref","unstructured":"Zhang, J., & Beck, J. C. (2024). Solving LBBD master problems with constraint programming and domain-independent dynamic programming. In: 30th International Conference on Principles and Practice of Constraint Programming (CP 2024), pp. 611\u2013631 . Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik","DOI":"10.1007\/s10601-025-09382-1"},{"key":"9382_CR13","volume-title":"Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J Hooker","year":"2011","unstructured":"Hooker, J. (2011). Logic-based Methods for Optimization: Combining Optimization and Constraint Satisfaction. New York: John Wiley & Sons."},{"issue":"1","key":"9382_CR14","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1287\/ijoc.2020.1015","volume":"34","author":"H Zohali","year":"2022","unstructured":"Zohali, H., Naderi, B., & Roshanaei, V. (2022). Solving the type-2 assembly line balancing with setups using logic-based Benders decomposition. INFORMS Journal on Computing, 34(1), 315\u2013332.","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"9382_CR15","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1016\/j.ejor.2016.11.001","volume":"259","author":"S Akpinar","year":"2017","unstructured":"Akpinar, S., Elmi, A., & Bekta\u015f, T. (2017). Combinatorial Benders cuts for assembly line balancing problems with setups. European Journal of Operational Research, 259(2), 527\u2013537.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"9382_CR16","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.ejor.2004.07.023","volume":"168","author":"C Becker","year":"2006","unstructured":"Becker, C., & Scholl, A. (2006). A survey on problems and methods in generalized assembly line balancing. European Journal of Operational Research, 168(3), 694\u2013715.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"9382_CR17","first-page":"29","volume":"13","author":"N Kumar","year":"2013","unstructured":"Kumar, N., & Mahto, D. (2013). Assembly line balancing: a review of developments and trends in approach to industrial application. Global Journal of Research in Engineering - G: Industrial Engineering, 13(2), 29\u201350.","journal-title":"Global Journal of Research in Engineering - G: Industrial Engineering"},{"issue":"3","key":"9382_CR18","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1016\/j.ejor.2006.07.044","volume":"187","author":"C Andres","year":"2008","unstructured":"Andres, C., Miralles, C., & Pastor, R. (2008). Balancing and scheduling tasks in assembly lines with sequence-dependent setup times. European Journal of Operational Research, 187(3), 1212\u20131223.","journal-title":"European Journal of Operational Research"},{"key":"9382_CR19","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/s00291-011-0265-0","volume":"35","author":"A Scholl","year":"2013","unstructured":"Scholl, A., Boysen, N., & Fliedner, M. (2013). The assembly line balancing and scheduling problem with sequence-dependent setup times: Problem extension, model formulation and efficient heuristics. OR Spectrum, 35, 291\u2013320.","journal-title":"OR Spectrum"},{"issue":"4","key":"9382_CR20","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/ijoc.2024.0603","volume":"37","author":"J Zhang","year":"2025","unstructured":"Zhang, J., & Beck, J. C. (2025). Domain-independent dynamic programming and constraint programming approaches for assembly line balancing problems with setups. INFORMS Journal on Computing, 37(4), 977\u2013997.","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"9382_CR21","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1016\/j.ejor.2019.05.001","volume":"278","author":"AS Michels","year":"2019","unstructured":"Michels, A. S., Lopes, T. C., Sikora, C. G. S., & Magat\u00e3o, L. (2019). A benders\u2019 decomposition algorithm with combinatorial cuts for the multi-manned assembly line balancing problem. European Journal of Operational Research, 278(3), 796\u2013808.","journal-title":"European Journal of Operational Research"},{"issue":"8","key":"9382_CR22","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1287\/mnsc.32.8.909","volume":"32","author":"I Baybars","year":"1986","unstructured":"Baybars, I. (1986). A survey of exact algorithms for the simple assembly line balancing problem. Management Science, 32(8), 909\u2013932.","journal-title":"Management Science"},{"issue":"4","key":"9382_CR23","doi-asserted-by":"publisher","first-page":"1345","DOI":"10.1111\/itor.12206","volume":"25","author":"M Ritt","year":"2018","unstructured":"Ritt, M., & Costa, A. M. (2018). Improved integer programming models for simple assembly line balancing and related problems. International Transactions in Operational Research, 25(4), 1345\u20131359.","journal-title":"International Transactions in Operational Research"},{"key":"9382_CR24","unstructured":"Zhang, W. (1998). Complete anytime beam search. In: Proceedings of the 1998 15th National Conference on Artificial Intelligence, AAAI"},{"key":"9382_CR25","doi-asserted-by":"crossref","unstructured":"Vadlamudi, S. G., Gaurav, P., Aine, S., & Chakrabarti, P. P. (2012). Anytime column search. AI 2012: Advances in Artificial Intelligence, 254","DOI":"10.1007\/978-3-642-35101-3_22"},{"key":"9382_CR26","doi-asserted-by":"crossref","unstructured":"Chu, Y., & Xia, Q. (2004). Generating Benders cuts for a general class of integer programming problems. In Proceedings of the 1st International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR 2004, (Ed.), R\u00e9gin, J.-C., Rueher, M (Vol. 3011, pp. 127\u2013136). Berlin Heidelberg: Springer.","DOI":"10.1007\/978-3-540-24664-0_9"},{"issue":"4","key":"9382_CR27","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1287\/opre.1060.0286","volume":"54","author":"G Codato","year":"2006","unstructured":"Codato, G., & Fischetti, M. (2006). Combinatorial Benders\u2019 cuts for mixed-integer linear programming. Operations Research, 54(4), 756\u2013766.","journal-title":"Operations Research"},{"issue":"3","key":"9382_CR28","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(90)90046-3","volume":"41","author":"R Dechter","year":"1990","unstructured":"Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41(3), 273\u2013312.","journal-title":"Artificial Intelligence"},{"key":"9382_CR29","unstructured":"Katsirelos, G., & Bacchus, F. (2005) Generalized nogoods in CSPs. In: Proceedings of the 20th National Conference on Artificial intelligence-Volume 1, pp. 390\u2013396"},{"key":"9382_CR30","unstructured":"Bayardo\u00a0Jr, R. J., & Schrag, R. (1997). Using CSP look-back techniques to solve real-world sat instances. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 203\u2013208"},{"issue":"3","key":"9382_CR31","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1016\/j.ejor.2006.06.078","volume":"189","author":"R Sadykov","year":"2008","unstructured":"Sadykov, R. (2008). A branch-and-check algorithm for minimizing the weighted number of late jobs on a single machine with release dates. European Journal of Operational Research, 189(3), 1284\u20131304.","journal-title":"European Journal of Operational Research"},{"key":"9382_CR32","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s10479-011-1031-z","volume":"210","author":"E Coban","year":"2013","unstructured":"Coban, E., & Hooker, J. N. (2013). Single-facility scheduling by logic-based Benders decomposition. Annals of Operations Research, 210, 245\u2013272.","journal-title":"Annals of Operations Research"},{"key":"9382_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s43069-020-00023-2","volume":"1","author":"E Lam","year":"2020","unstructured":"Lam, E., Gange, G., Stuckey, P. J., Van Hentenryck, P., & Dekker, J. J. (2020). Nutmeg: a MIP and CP hybrid solver using branch-and-check. SN Operations Research Forum, 1, 1\u201327.","journal-title":"SN Operations Research Forum"},{"key":"9382_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.omega.2017.06.008","volume":"78","author":"Y Bukchin","year":"2018","unstructured":"Bukchin, Y., & Raviv, T. (2018). Constraint programming for solving various assembly line balancing problems. Omega, 78, 57\u201368.","journal-title":"Omega"},{"key":"9382_CR35","doi-asserted-by":"crossref","unstructured":"Shaw, P. (2004). A constraint for bin packing. In: Proceedings of the 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), pp. 648\u2013662. Springer","DOI":"10.1007\/978-3-540-30201-8_47"},{"key":"9382_CR36","unstructured":"IBM. IBM ILOG CPLEX Optimizer. Accessed on 2024-04-20. https:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio\/cplex-cp-optimizer"},{"key":"9382_CR37","unstructured":"Beck, J. C., Kuroiwa, R., Lee, J. H., Stuckey, P. J., & Zhong, A. Z. (2025). Transition dominance in domain-independent dynamic programming. In: 31st International Conference on Principles and Practice of Constraint Programming (CP 2025), pp. 5\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik"},{"issue":"4","key":"9382_CR38","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1287\/ijoc.9.4.319","volume":"9","author":"A Scholl","year":"1997","unstructured":"Scholl, A., & Klein, R. (1997). Salome: A bidirectional branch-and-bound procedure for assembly line balancing. INFORMS Journal on Computing, 9(4), 319\u2013334.","journal-title":"INFORMS Journal on Computing"},{"key":"9382_CR39","doi-asserted-by":"crossref","unstructured":"Akpinar, \u015e., & Baykaso\u011flu, A. (2014). Modeling and solving mixed-model assembly line balancing problem with setups. part I: A mixed integer linear programming model. Journal of Manufacturing Systems 33(1), 177\u2013187","DOI":"10.1016\/j.jmsy.2013.11.004"},{"issue":"20","key":"9382_CR40","doi-asserted-by":"publisher","first-page":"12899","DOI":"10.1007\/s00500-021-06107-3","volume":"25","author":"H Yilmaz","year":"2021","unstructured":"Yilmaz, H. (2021). Modeling and solving assembly line worker assignment and balancing problem with sequence-dependent setup times. Soft Computing, 25(20), 12899\u201312914.","journal-title":"Soft Computing"},{"issue":"1","key":"9382_CR41","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1080\/0305215X.2021.1953003","volume":"54","author":"A Furugi","year":"2022","unstructured":"Furugi, A. (2022). Sequence-dependent time-and cost-oriented assembly line balancing problems: A combinatorial Benders\u2019 decomposition approach. Engineering Optimization, 54(1), 170\u2013184.","journal-title":"Engineering Optimization"},{"key":"9382_CR42","unstructured":"Gurobi\u00a0Optimization, L. (2021). Gurobi Optimizer Reference Manual. Accessed on 2024-04-10. http:\/\/www.gurobi.com"},{"key":"9382_CR43","doi-asserted-by":"publisher","unstructured":"Beck, J. C. (2010). Checking-up on branch-and-check. In: Cohen, D. (ed.) Proceedings of the 16th International Conference on Principles and Practice of Constraint Programming (CP 2010), pp. 84\u201398. Springer, Berlin Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-15396-9_10","DOI":"10.1007\/978-3-642-15396-9_10"},{"key":"9382_CR44","first-page":"2440","volume":"711","author":"HB Amor","year":"2004","unstructured":"Amor, H. B., Desrosiers, J., & Frangioni, A. (2004). Stabilization in column generation. Les Cahiers du GERAD ISSN, 711, 2440.","journal-title":"Les Cahiers du GERAD ISSN"},{"key":"9382_CR45","volume-title":"Column Generation","author":"G Desaulniers","year":"2006","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M. M. (2006). Column Generation (Vol. 5). New York: Springer."},{"key":"9382_CR46","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/BF01580883","volume":"35","author":"A Ruszczy\u0144ski","year":"1986","unstructured":"Ruszczy\u0144ski, A. (1986). A regularized decomposition method for minimizing a sum of polyhedral functions. Mathematical Programming, 35, 309\u2013333.","journal-title":"Mathematical Programming"},{"key":"9382_CR47","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1023\/A:1021858008222","volume":"24","author":"J Linderoth","year":"2003","unstructured":"Linderoth, J., & Wright, S. (2003). Decomposition algorithms for stochastic programming on a computational grid. Computational Optimization and Applications, 24, 207\u2013250.","journal-title":"Computational Optimization and Applications"},{"issue":"3","key":"9382_CR48","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.ejor.2016.12.005","volume":"259","author":"R Rahmaniani","year":"2017","unstructured":"Rahmaniani, R., Crainic, T. G., Gendreau, M., & Rei, W. (2017). The Benders decomposition algorithm: A literature review. European Journal of Operational Research, 259(3), 801\u2013817.","journal-title":"European Journal of Operational Research"},{"key":"9382_CR49","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12532-012-0038-z","volume":"4","author":"V Zverovich","year":"2012","unstructured":"Zverovich, V., F\u00e1bi\u00e1n, C. I., Ellison, E. F., & Mitra, G. (2012). A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition. Mathematical Programming Computation, 4, 211\u2013238.","journal-title":"Mathematical Programming Computation"},{"key":"9382_CR50","unstructured":"IBM. IBM ILOG CP Optimizer. Accessed on 2024-04-20. https:\/\/ibmdecisionoptimization.github.io\/docplex-doc\/cp.html"},{"key":"9382_CR51","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S1574-6526(07)03004-0","volume":"3","author":"F Rossi","year":"2008","unstructured":"Rossi, F., Van Beek, P., & Walsh, T. (2008). Constraint programming. Foundations of Artificial Intelligence, 3, 181\u2013211.","journal-title":"Foundations of Artificial Intelligence"},{"key":"9382_CR52","unstructured":"Hsu, C.-W., Wah, B. W., Huang, R., & Chen, Y. (2007). Constraint partitioning for solving planning problems with trajectory constraints and goal preferences. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), pp. 1924\u20131929"},{"issue":"5\u20136","key":"9382_CR53","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1016\/j.artint.2008.11.011","volume":"173","author":"JA Baier","year":"2009","unstructured":"Baier, J. A., Bacchus, F., & McIlraith, S. A. (2009). A heuristic search approach to planning with temporally extended preferences. Artificial Intelligence, 173(5\u20136), 593\u2013618.","journal-title":"Artificial Intelligence"},{"key":"9382_CR54","unstructured":"Rahmaniani, R., Crainic, T. G., Gendreau, M., & Rei, W. (2018). The Asynchronous Benders Decomposition Method. CIRRELT"},{"issue":"5","key":"9382_CR55","doi-asserted-by":"publisher","first-page":"2591","DOI":"10.1287\/opre.2021.0503","volume":"73","author":"M Hosseini","year":"2024","unstructured":"Hosseini, M., & Turner, J. (2024). Deepest cuts for Benders decomposition. Operations Research, 73(5), 2591\u20132609.","journal-title":"Operations Research"},{"issue":"5","key":"9382_CR56","doi-asserted-by":"publisher","first-page":"1252","DOI":"10.1287\/trsc.2022.0073","volume":"57","author":"C Ram\u00edrez-Pico","year":"2023","unstructured":"Ram\u00edrez-Pico, C., Ljubi\u0107, I., & Moreno, E. (2023). Benders adaptive-cuts method for two-stage stochastic programs. Transportation Science, 57(5), 1252\u20131275.","journal-title":"Transportation Science"},{"issue":"2","key":"9382_CR57","doi-asserted-by":"publisher","first-page":"1233","DOI":"10.1109\/TWC.2020.3031920","volume":"20","author":"M Lee","year":"2020","unstructured":"Lee, M., Ma, N., Yu, G., & Dai, H. (2020). Accelerating generalized Benders decomposition for wireless resource allocation. IEEE Transactions on Wireless Communications, 20(2), 1233\u20131247.","journal-title":"IEEE Transactions on Wireless Communications"},{"issue":"1","key":"9382_CR58","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1287\/ijoc.2015.0666","volume":"28","author":"TT Tran","year":"2016","unstructured":"Tran, T. T., Araujo, A., & Beck, J. C. (2016). Decomposition methods for the parallel machine scheduling problem with setups. INFORMS Journal on Computing, 28(1), 83\u201395.","journal-title":"INFORMS Journal on Computing"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-025-09382-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-025-09382-1","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-025-09382-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:12:16Z","timestamp":1770970336000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-025-09382-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12]]},"references-count":58,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["9382"],"URL":"https:\/\/doi.org\/10.1007\/s10601-025-09382-1","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12]]},"assertion":[{"value":"27 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 December 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Author J. Christopher Beck is the past President of the Executive Committee of the Association for Constraint Programming. The authors declare they have no financial or non-financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to Participate"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Materials Availability"}},{"value":"The code will be available online.","order":6,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code Availability"}}]}}