{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T09:42:49Z","timestamp":1756460569655,"version":"3.37.3"},"reference-count":58,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Interdepartmental project on Artificial Intelligence"},{"name":"INdAM-GNCS"},{"name":"NFS","award":["2151254","191463"],"award-info":[{"award-number":["2151254","191463"]}]},{"name":"Synchrony"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10601-024-09371-w","type":"journal-article","created":{"date-parts":[[2024,10,18]],"date-time":"2024-10-18T11:03:40Z","timestamp":1729249420000},"page":"192-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Constraint propagation on GPU: a case study for the cumulative constraint"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3328-2174","authenticated-orcid":false,"given":"Fabio","family":"Tardivo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Formisano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,18]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Artigues, C., Demassey, S., Nron, E. (2008). Resource-Constrained Project Scheduling: Models, Algorithms, Extensions and Applications. John Wiley & Sons, Ltd, Hoboken, NJ, USA. https:\/\/doi.org\/10.1002\/9780470611227","key":"9371_CR1","DOI":"10.1002\/9780470611227"},{"doi-asserted-by":"publisher","unstructured":"Ganian, R., Hamm, T., Mescoff, G. (2020). The complexity landscape of resource-constrained scheduling. In: Bessiere, C. (ed.), Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, IJCAI 2020, (pp. 1741\u20131747). ijcai.org, California, USA. https:\/\/doi.org\/10.24963\/IJCAI.2020\/241","key":"9371_CR2","DOI":"10.24963\/IJCAI.2020\/241"},{"doi-asserted-by":"publisher","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W. (2001). Constraint-Based Scheduling. Springer\u00a0Science, New York. https:\/\/doi.org\/10.1007\/978-1-4615-1479-4","key":"9371_CR3","DOI":"10.1007\/978-1-4615-1479-4"},{"doi-asserted-by":"publisher","unstructured":"Tardivo, F., Dovier, A., Formisano, A., Michel, L., Pontelli, E. (2023). Constraint propagation on GPU: A case study for the cumulative constraint. In: Cir\u00e9, A.A. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 20th International Conference, CPAIOR 2023, Nice, France, May 29 - June 1, 2023, Proceedings. Lecture Notes in Computer Science, (vol. 13884, pp. 336\u2013353). Springer. https:\/\/doi.org\/10.1007\/978-3-031-33271-5_22","key":"9371_CR4","DOI":"10.1007\/978-3-031-33271-5_22"},{"doi-asserted-by":"publisher","unstructured":"Apt, K. (2003). Principles of Constraint Programming. Cambridge University Press, UK. https:\/\/doi.org\/10.1017\/cbo9780511615320","key":"9371_CR5","DOI":"10.1017\/cbo9780511615320"},{"unstructured":"Rossi, F., van Beek, P., Walsh, T. (2006). Handbook of Constraint Programming. Foundations of Artificial Intelligence, (vol. 2.) Elsevier, Netherlands. https:\/\/www.sciencedirect.com\/science\/bookseries\/15746526\/2","key":"9371_CR6"},{"unstructured":"Sanders, J., Kandrot, E. (2010). CUDA by Example: An Introduction to General-Purpose GPU Programming. Addison-Wesley Professional, USA. https:\/\/developer.nvidia.com\/cuda-example","key":"9371_CR7"},{"unstructured":"Cheng, J., Grossman, M., McKercher, T. (2014). Professional CUDA\u00a0C Programming. EBL-Schweitzer. John Wiley & Sons, Ltd, Hoboken, NJ, USA. https:\/\/www.wiley.com\/en-us\/Professional+CUDA+C+Programming-p-9781118739310","key":"9371_CR8"},{"doi-asserted-by":"publisher","unstructured":"Aggoun, A., & Beldiceanu, N. (1993). Extending CHIP in order to solve complex scheduling and placement problems. Mathematical and Computer Modelling, 57\u201373. https:\/\/doi.org\/10.1016\/0895-7177(93)90068-a","key":"9371_CR9","DOI":"10.1016\/0895-7177(93)90068-a"},{"doi-asserted-by":"publisher","unstructured":"Hebrard, E. (2018). Reasoning about np-complete constraints. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, (pp. 5672\u20135676). Sweden. https:\/\/doi.org\/10.24963\/IJCAI.2018\/807","key":"9371_CR10","DOI":"10.24963\/IJCAI.2018\/807"},{"issue":"6","key":"9371_CR11","first-page":"209","volume":"294","author":"A Lahrichi","year":"1982","unstructured":"Lahrichi, A. (1982). Scheduling: the notions of hump, compulsory parts and their use in cumulative problems. Comptes Rendus De L Academie Des Sciences Serie I-mathematique, 294(6), 209\u2013211.","journal-title":"Comptes Rendus De L Academie Des Sciences Serie I-mathematique"},{"doi-asserted-by":"publisher","unstructured":"Beldiceanu, N., Carlsson, M. (2002). A new multi-resource cumulatives constraint with negative heights. In: Lecture Notes in Computer Science, (pp. 63\u201379). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/3-540-46135-3_5","key":"9371_CR12","DOI":"10.1007\/3-540-46135-3_5"},{"doi-asserted-by":"publisher","unstructured":"Letort, A., Beldiceanu, N., Carlsson, M. (2012). A scalable sweep algorithm for the cumulative constraint. In: Lecture Notes in Computer Science, (pp. 439\u2013454). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-33558-7_33","key":"9371_CR13","DOI":"10.1007\/978-3-642-33558-7_33"},{"doi-asserted-by":"publisher","unstructured":"Gay, S., Hartert, R., Schaus, P. (2015). Simple and scalable time-table filtering for the cumulative constraint. In: Pesant, G. (ed.) Principles and Practice of Constraint Programming, CP 2015. Lecture Notes in Computer Science, (vol. 9255). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-23219-5_11","key":"9371_CR14","DOI":"10.1007\/978-3-319-23219-5_11"},{"unstructured":"Nuijten, W. (1994). Time and resource constrained scheduling: a constraint satisfaction approach. PhD thesis, Eindhoven University of Technology","key":"9371_CR15"},{"issue":"1","key":"9371_CR16","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1287\/ijoc.1070.0226","volume":"20","author":"L Mercier","year":"2008","unstructured":"Mercier, L., & Van Hentenryck, P. (2008). Edge finding for cumulative scheduling. INFORMS Journal on Computing, 20(1), 143\u2013153. https:\/\/doi.org\/10.1287\/ijoc.1070.0226","journal-title":"INFORMS Journal on Computing"},{"doi-asserted-by":"publisher","unstructured":"Vil\u00edm, P. (2009). Edge finding filtering algorithm for discrete cumulative resources in $$\\cal{O}(kn\\log n)$$. In: Principles and Practice of Constraint Programming - CP 2009, (pp. 802\u2013816). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-04244-7_62","key":"9371_CR17","DOI":"10.1007\/978-3-642-04244-7_62"},{"doi-asserted-by":"publisher","unstructured":"Kameugne, R., Fotso, L.P., Scott, J., Ngo-Kateu, Y. (2011). A quadratic edge-finding filtering algorithm for cumulative resource constraints. In: Principles and Practice of Constraint Programming - CP 2011, (pp. 478\u2013492). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-23786-7_37","key":"9371_CR18","DOI":"10.1007\/978-3-642-23786-7_37"},{"doi-asserted-by":"publisher","unstructured":"Ouellet, P., Quimper, C.-G. (2013). Time-table extended-edge-finding for the cumulative constraint. In: Lecture Notes in Computer Science, (pp. 562\u2013577). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-40627-0_42","key":"9371_CR19","DOI":"10.1007\/978-3-642-40627-0_42"},{"doi-asserted-by":"publisher","unstructured":"Schutt, A., Feydy, T., Stuckey, P.J. (2013). Explaining time-table-edge-finding propagation for the cumulative resource constraint. In: Gomes, C.P., Sellmann, M. (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2013. Lecture Notes in Computer Science, (vol. 7874, pp. 234\u2013250). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-38171-3_16","key":"9371_CR20","DOI":"10.1007\/978-3-642-38171-3_16"},{"unstructured":"Gingras, V., Quimper, C. (2016). Generalizing the edge-finder rule for the cumulative constraint. In: Kambhampati, S. (ed.) Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, (pp. 3103\u20133109). IJCAI\/AAAI Press, California, USA","key":"9371_CR21"},{"doi-asserted-by":"publisher","unstructured":"Vil\u00edm, P. (2011). Timetable edge finding filtering algorithm for discrete cumulative resources. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, (pp. 230\u2013245). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-21311-3_22","key":"9371_CR22","DOI":"10.1007\/978-3-642-21311-3_22"},{"issue":"3","key":"9371_CR23","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1007\/S10601-018-9282-9","volume":"23","author":"H Fahimi","year":"2018","unstructured":"Fahimi, H., Ouellet, Y., & Quimper, C. (2018). Linear-time filtering algorithms for the disjunctive constraint and a quadratic filtering algorithm for the cumulative not-first not-last. Constraints An Int. J., 23(3), 272\u2013293. https:\/\/doi.org\/10.1007\/S10601-018-9282-9","journal-title":"Constraints An Int. J."},{"doi-asserted-by":"publisher","unstructured":"Schutt, A., Wolf, A., Schrader, G. (2005). Not-first and not-last detection for cumulative scheduling in $$\\cal{O}(n^3\\log n)$$. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O. (eds.) Declarative Programming for Knowledge Management. Lecture Notes in Computer Science, (vol. 4369, pp. 66\u201380). Springer, Berlin Heidelberg. https:\/\/doi.org\/10.1007\/11963578_6","key":"9371_CR24","DOI":"10.1007\/11963578_6"},{"doi-asserted-by":"publisher","unstructured":"Schutt, A., Wolf, A. (2010). A new $$\\cal{O}(n^2\\log n)$$ not-first\/not-last pruning algorithm for cumulative resource constraints. In: Principles and Practice of Constraint Programming - CP 2010, (pp. 445\u2013459). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/978-3-642-15396-9_36","key":"9371_CR25","DOI":"10.1007\/978-3-642-15396-9_36"},{"issue":"1","key":"9371_CR26","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s13226-013-0005-z","volume":"44","author":"R Kameugne","year":"2013","unstructured":"Kameugne, R., & Fotso, L. P. (2013). A cumulative not-first\/not-last filtering algorithm in $$\\cal{O} (n^2\\log n)$$. Indian Journal of Pure and Applied Mathematics, 44(1), 95\u2013115. https:\/\/doi.org\/10.1007\/s13226-013-0005-z","journal-title":"Indian Journal of Pure and Applied Mathematics"},{"doi-asserted-by":"publisher","unstructured":"Kameugne, R., Betmbe Fetgo, S., Gingras, V., Ouellet, Y., Quimper, C.-G. (2018). Horizontally elastic not-first\/not-last filtering algorithm for cumulative resource constraint. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (pp. 316\u2013332). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-93031-2_23","key":"9371_CR27","DOI":"10.1007\/978-3-319-93031-2_23"},{"unstructured":"Lopez, P. (1991). Energy-based approach for task scheduling under time and resource constraints. PhD thesis, Universit\u00e9 Paul Sabatier-Toulouse III","key":"9371_CR28"},{"key":"9371_CR29","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1023\/a:1018995000688","volume":"92","author":"P Baptiste","year":"1999","unstructured":"Baptiste, P., Le Pape, C., & Nuijten, W. (1999). Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Annals of Operations Research, 92, 305\u2013333. https:\/\/doi.org\/10.1023\/a:1018995000688","journal-title":"Annals of Operations Research"},{"doi-asserted-by":"publisher","unstructured":"Derrien, A., Petit, T. (2014). A new characterization of relevant intervals for energetic reasoning. In: Lecture Notes in Computer Science, (pp. 289\u2013297). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-10428-7_22","key":"9371_CR30","DOI":"10.1007\/978-3-319-10428-7_22"},{"doi-asserted-by":"publisher","unstructured":"Tesch, A. (2016). A nearly exact propagation algorithm for energetic reasoning in $$\\cal{O}(n^2 \\log n)$$. In: Lecture Notes in Computer Science, (pp. 493\u2013519). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-44953-1_32","key":"9371_CR31","DOI":"10.1007\/978-3-319-44953-1_32"},{"doi-asserted-by":"publisher","unstructured":"Ouellet, Y., Quimper, C.-G. (2018). A $$\\cal{O}(n \\log ^2 n)$$ checker and $$\\cal{O}(n^2\\log n)$$ filtering algorithm for the energetic reasoning. In: Integration of Constraint Programming, Artificial Intelligence, and Operations Research, (pp. 477\u2013494). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-93031-2_34","key":"9371_CR32","DOI":"10.1007\/978-3-319-93031-2_34"},{"doi-asserted-by":"publisher","unstructured":"Tesch, A. (2018). Improving energetic propagations for cumulative scheduling. In: Lecture Notes in Computer Science, (pp. 629\u2013645). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-98334-9_41","key":"9371_CR33","DOI":"10.1007\/978-3-319-98334-9_41"},{"issue":"3","key":"9371_CR34","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1080\/0952813X.2014.954274","volume":"27","author":"A Dal Pal\u00f9","year":"2015","unstructured":"Dal Pal\u00f9, A., Dovier, A., Formisano, A., & Pontelli, E. (2015). CUD@SAT: SAT solving on GPUs. Journal of Experimental & Theoretical Artificial Intelligence, 27(3), 293\u2013316. https:\/\/doi.org\/10.1080\/0952813X.2014.954274","journal-title":"Journal of Experimental & Theoretical Artificial Intelligence"},{"unstructured":"Collevati, M., Dovier, A., Formisano, A. (2022). GPU parallelism for SAT solving heuristics. In: Calegari, R., Ciatto, G., Omicini, A. (eds.) Proceedings of the CILC\u201922. CEUR Workshop Proceedings, (vol. 3204, pp. 17\u201331). CEUR-WS.org, RWTH Aachen University. https:\/\/ceur-ws.org\/Vol-3204\/paper_3.pdf","key":"9371_CR35"},{"doi-asserted-by":"publisher","unstructured":"Dovier, A., Formisano, A., Pontelli, E. (2018). Parallel answer set programming. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, (pp. 237\u2013282). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-63516-3_7","key":"9371_CR36","DOI":"10.1007\/978-3-319-63516-3_7"},{"doi-asserted-by":"publisher","unstructured":"Dovier, A., Formisano, A., Vella, F. (2020). GPU-Based Parallelism for ASP-Solving. In: Hofstedt, P., Abreu, S., John, U., Kuchen, H., Seipel, D. (eds.) Declarative Programming and Knowledge Management, INAP WLP WFLP 2019. Lecture Notes in Computer Science, (vol. 12057, pp. 3\u201323). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-46714-2_1","key":"9371_CR37","DOI":"10.1007\/978-3-030-46714-2_1"},{"issue":"8","key":"9371_CR38","doi-asserted-by":"publisher","first-page":"1734","DOI":"10.1093\/LOGCOM\/EXAD033","volume":"33","author":"F Tardivo","year":"2023","unstructured":"Tardivo, F., Dovier, A., Formisano, A., Michel, L., & Pontelli, E. (2023). Constraint propagation on GPU: A case study for the alldifferent constraint. Journal of Logic and Computation, 33(8), 1734\u20131752. https:\/\/doi.org\/10.1093\/LOGCOM\/EXAD033","journal-title":"Journal of Logic and Computation"},{"unstructured":"Nvidia Team. CUDA. https:\/\/developer.nvidia.com\/cuda-toolkit","key":"9371_CR39"},{"unstructured":"Tardivo, F. fzn-minicpp. MiniCPP backend for MiniZinc. https:\/\/bitbucket.org\/constraint-programming\/fzn-minicpp","key":"9371_CR40"},{"doi-asserted-by":"publisher","unstructured":"Michel, L., Schaus, P., Van Hentenryck, P. (2021). MiniCP: a lightweight solver for constraint programming. Mathematical Programming Computation, 133\u2013184. https:\/\/doi.org\/10.1007\/s12532-020-00190-7","key":"9371_CR41","DOI":"10.1007\/s12532-020-00190-7"},{"doi-asserted-by":"publisher","unstructured":"Gentzel, R., Michel, L., van Hoeve, W.-J. (2020). HADDOCK: A language and\u00a0architecture for decision diagram compilation. In: Lecture Notes in Computer Science, (pp. 531\u2013547). Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-030-58475-7_31","key":"9371_CR42","DOI":"10.1007\/978-3-030-58475-7_31"},{"unstructured":"Tardivo, F. libfzn. Library to interact with MiniZinc. https:\/\/bitbucket.org\/constraint-programming\/libfzn","key":"9371_CR43"},{"unstructured":"Chuffed Team. Chuffed. https:\/\/github.com\/chuffed\/chuffed","key":"9371_CR44"},{"unstructured":"Tardivo, F., Chuffed Team. Chuffed. Chuffed with a GPU-accelerater propagator for Cumulative constraint. https:\/\/bitbucket.org\/constraint-programming\/chuffed","key":"9371_CR45"},{"issue":"1","key":"9371_CR46","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/s0377-2217(96)00170-1","volume":"96","author":"R Kolisch","year":"1997","unstructured":"Kolisch, R., & Sprecher, A. (1997). PSPLIB - a project scheduling problem library. European Journal of Operational Research, 96(1), 205\u2013216. https:\/\/doi.org\/10.1016\/s0377-2217(96)00170-1","journal-title":"European Journal of Operational Research"},{"doi-asserted-by":"publisher","unstructured":"Baptiste, P., Le Pape, C. (1997). Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. In: Principles and Practice of Constraint Programming-CP97, (pp. 375\u2013389). Springer, Berlin, Heidelberg. https:\/\/doi.org\/10.1007\/bfb0017454","key":"9371_CR47","DOI":"10.1007\/bfb0017454"},{"issue":"2","key":"9371_CR48","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/s0377-2217(02)00763-4","volume":"149","author":"J Carlier","year":"2003","unstructured":"Carlier, J., & N\u00e9ron, E. (2003). On linear lower bounds for the resource constrained project scheduling problem. European Journal of Operational Research, 149(2), 314\u2013324. https:\/\/doi.org\/10.1016\/s0377-2217(02)00763-4","journal-title":"European Journal of Operational Research"},{"unstructured":"MiniZinc Team. The MiniZinc Benchmark Suite. https:\/\/github.com\/MiniZinc\/minizinc-benchmarks","key":"9371_CR49"},{"unstructured":"Tardivo, F. MiniCPP-Benchmarks. Set of benchmarks for GPU-accelerated constraints. https:\/\/bitbucket.org\/constraint-programming\/minicpp-benchmarks","key":"9371_CR50"},{"unstructured":"Jacop Team. JaCoP. https:\/\/github.com\/radsz\/jacop","key":"9371_CR51"},{"unstructured":"Gecode Team. GECODE. https:\/\/github.com\/Gecode\/gecode","key":"9371_CR52"},{"unstructured":"MiniZinc Team. MiniZinc Challenge 2022 Results. https:\/\/www.minizinc.org\/challenge2022\/results2022.html","key":"9371_CR53"},{"unstructured":"MiniZinc Team. MiniZinc Challenge 2023 Results. https:\/\/www.minizinc.org\/challenge2023\/results2023.html","key":"9371_CR54"},{"doi-asserted-by":"publisher","unstructured":"Cauwelaert, S.V., Lombardi, M., Schaus, P. (2015). Understanding the potential of propagators. In: Integration of AI and OR Techniques in Constraint Programming. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-18008-3_29","key":"9371_CR55","DOI":"10.1007\/978-3-319-18008-3_29"},{"doi-asserted-by":"publisher","unstructured":"Vil\u00edm, P., Laborie, P., Shaw, P. (2015). Failure-directed search for constraint-based scheduling. In: Michel, L. (ed.) Integration of AI and OR Techniques in Constraint Programming, CPAIOR 2015. Lecture Notes in Computer Science, vol. 9075, pp. 437\u2013453. Springer, Barcelona, Spain. https:\/\/doi.org\/10.1007\/978-3-319-18008-3_30","key":"9371_CR56","DOI":"10.1007\/978-3-319-18008-3_30"},{"doi-asserted-by":"publisher","unstructured":"Gay, S., Hartert, R., Lecoutre, C., Schaus, P. (2015). Conflict ordering search for scheduling problems. In: Pesant, G. (ed.) Principles and Practice of Constraint Programming, CP 2015. Lecture Notes in Computer Science, vol. 9255, pp. 140\u2013148. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-23219-5_10","key":"9371_CR57","DOI":"10.1007\/978-3-319-23219-5_10"},{"issue":"3","key":"9371_CR58","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/S10601-010-9103-2","volume":"16","author":"A Schutt","year":"2011","unstructured":"Schutt, A., Feydy, T., Stuckey, P. J., & Wallace, M. G. (2011). Explaining the cumulative propagator. Constraints An Int. J., 16(3), 250\u2013282. https:\/\/doi.org\/10.1007\/S10601-010-9103-2","journal-title":"Constraints An Int. J."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-024-09371-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-024-09371-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-024-09371-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T11:11:09Z","timestamp":1730718669000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-024-09371-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":58,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9371"],"URL":"https:\/\/doi.org\/10.1007\/s10601-024-09371-w","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"13 August 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}