{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T20:14:05Z","timestamp":1742933645048,"version":"3.40.3"},"publisher-location":"Cham","reference-count":48,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031332708"},{"type":"electronic","value":"9783031332715"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33271-5_22","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"336-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Constraint Propagation on\u00a0GPU: A Case Study for\u00a0the\u00a0Cumulative Constraint"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3328-2174","authenticated-orcid":false,"given":"Fabio","family":"Tardivo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2052-8593","authenticated-orcid":false,"given":"Agostino","family":"Dovier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6755-9314","authenticated-orcid":false,"given":"Andrea","family":"Formisano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7230-7130","authenticated-orcid":false,"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7753-1737","authenticated-orcid":false,"given":"Enrico","family":"Pontelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/0895-7177(93)90068-a","volume":"17","author":"A Aggoun","year":"1993","unstructured":"Aggoun, A., Beldiceanu, N.: Extending CHIP in order to solve complex scheduling and placement problems. Math. Comput. Model. 17, 57\u201373 (1993). https:\/\/doi.org\/10.1016\/0895-7177(93)90068-a","journal-title":"Math. Comput. Model."},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Apt, K.: Principles of Constraint Programming. Cambridge University Press (2003). https:\/\/doi.org\/10.1017\/cbo9780511615320","DOI":"10.1017\/cbo9780511615320"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Artigues, C., Demassey, S., Nron, E. (eds.): Resource-Constrained Project Scheduling. ISTE (2008). https:\/\/doi.org\/10.1002\/9780470611227","DOI":"10.1002\/9780470611227"},{"key":"22_CR4","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.: Satisfiability tests and time-bound adjustments for cumulative scheduling problems. Ann. Oper. Res. 92, 305\u2013333 (1999). https:\/\/doi.org\/10.1023\/a:1018995000688","journal-title":"Ann. Oper. Res."},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/bfb0017454","volume-title":"Principles and Practice of Constraint Programming-CP97","author":"P Baptiste","year":"1997","unstructured":"Baptiste, P., Le Pape, C.: Constraint propagation and decomposition techniques for highly disjunctive and highly cumulative project scheduling problems. In: Smolka, G. (ed.) CP 1997. LNCS, pp. 375\u2013389. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/bfb0017454"},{"key":"22_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-1479-4","volume-title":"Constraint-Based Scheduling","author":"P Baptiste","year":"2001","unstructured":"Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-1-4615-1479-4"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-46135-3_5","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N Beldiceanu","year":"2002","unstructured":"Beldiceanu, N., Carlsson, M.: A new multi-resource cumulatives constraint with negative heights. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 63\u201379. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_5"},{"issue":"2","key":"22_CR8","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.: On linear lower bounds for the resource constrained project scheduling problem. Eur. J. Oper. Res. 149(2), 314\u2013324 (2003). https:\/\/doi.org\/10.1016\/s0377-2217(02)00763-4","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-18008-3_29","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Van Cauwelaert","year":"2015","unstructured":"Van Cauwelaert, S., Lombardi, M., Schaus, P.: Understanding the potential of propagators. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 427\u2013436. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_29"},{"key":"22_CR10","unstructured":"Cheng, J., Grossman, M., McKercher, T.: Professional CUDA C Programming. EBL-Schweitzer. Wiley (2014). https:\/\/www.wiley.com\/en-us\/Professional+CUDA+C+Programming-p-9781118739310"},{"key":"22_CR11","unstructured":"Collevati, M., Dovier, A., Formisano, A.: GPU parallelism for SAT solving heuristics. In: Calegari, R., Ciatto, G., Omicini, A. (eds.) Proceedings of the CILC 2022. CEUR Workshop Proceedings, vol. 3204, pp. 17\u201331. CEUR-WS.org (2022)"},{"issue":"3","key":"22_CR12","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.: CUD@SAT: SAT solving on GPUs. J. Exp. Theor. Artif. Intell. 27(3), 293\u2013316 (2015). https:\/\/doi.org\/10.1080\/0952813X.2014.954274","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-319-10428-7_22","volume-title":"Principles and Practice of Constraint Programming","author":"A Derrien","year":"2014","unstructured":"Derrien, A., Petit, T.: A new characterization of relevant intervals for energetic reasoning. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 289\u2013297. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_22"},{"key":"22_CR14","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-319-63516-3_7","volume-title":"Handbook of Parallel Constraint Reasoning","author":"A Dovier","year":"2018","unstructured":"Dovier, A., Formisano, A., Pontelli, E.: Parallel answer set programming. In: Hamadi, Y., Sais, L. (eds.) Handbook of Parallel Constraint Reasoning, pp. 237\u2013282. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-63516-3_7"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-46714-2_1","volume-title":"Declarative Programming and Knowledge Management","author":"A Dovier","year":"2020","unstructured":"Dovier, A., Formisano, A., Vella, F.: GPU-based parallelism for ASP-solving. In: Hofstedt, P., Abreu, S., John, U., Kuchen, H., Seipel, D. (eds.) INAP\/WLP\/WFLP -2019. LNCS (LNAI), vol. 12057, pp. 3\u201323. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-46714-2_1"},{"key":"22_CR16","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., USA (1990)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-23219-5_11","volume-title":"Principles and Practice of Constraint Programming","author":"S Gay","year":"2015","unstructured":"Gay, S., Hartert, R., Schaus, P.: Simple and scalable time-table filtering for the cumulative constraint. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 149\u2013157. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_11"},{"key":"22_CR18","unstructured":"Gecode Team: GECODE. https:\/\/github.com\/Gecode\/gecode"},{"key":"22_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-030-58475-7_31","volume-title":"Principles and Practice of Constraint Programming","author":"R Gentzel","year":"2020","unstructured":"Gentzel, R., Michel, L., van Hoeve, W.-J.: HADDOCK: a language and\u00a0architecture for decision diagram compilation. In: Simonis, H. (ed.) CP 2020. LNCS, vol. 12333, pp. 531\u2013547. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58475-7_31"},{"key":"22_CR20","unstructured":"Gingras, V., Quimper, C.G.: Generalizing the edge-finder rule for the cumulative constraint. In: Kambhampati, S. (ed.) Proceedings IJCAI 2016, pp. 3103\u20133109. IJCAI\/AAAI Press (2016)"},{"key":"22_CR21","unstructured":"JaCoP Team: JaCoP. https:\/\/github.com\/radsz\/jacop"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-319-93031-2_23","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"R Kameugne","year":"2018","unstructured":"Kameugne, R., Betmbe Fetgo, S., Gingras, V., Ouellet, Y., Quimper, C.-G.: Horizontally elastic not-first\/not-last filtering algorithm for cumulative resource constraint. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 316\u2013332. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_23"},{"issue":"1","key":"22_CR23","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.: A cumulative not-first\/not-last filtering algorithm in $$\\cal{O} (n^2\\log n)$$. Indian J. Pure Appl. Math. 44(1), 95\u2013115 (2013). https:\/\/doi.org\/10.1007\/s13226-013-0005-z","journal-title":"Indian J. Pure Appl. Math."},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/978-3-642-23786-7_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"R Kameugne","year":"2011","unstructured":"Kameugne, R., Fotso, L.P., Scott, J., Ngo-Kateu, Y.: A quadratic edge-finding filtering algorithm for cumulative resource constraints. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 478\u2013492. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_37"},{"issue":"1","key":"22_CR25","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.: PSPLIB - a project scheduling problem library. Eur. J. Oper. Res. 96(1), 205\u2013216 (1997). https:\/\/doi.org\/10.1016\/s0377-2217(96)00170-1","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"22_CR26","first-page":"209","volume":"294","author":"A Lahrichi","year":"1982","unstructured":"Lahrichi, A.: 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 (1982)","journal-title":"Comptes Rendus De L Academie Des Sciences Serie I-mathematique"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-642-33558-7_33","volume-title":"Principles and Practice of Constraint Programming","author":"A Letort","year":"2012","unstructured":"Letort, A., Beldiceanu, N., Carlsson, M.: A scalable sweep algorithm for the cumulative constraint. In: Milano, M. (ed.) CP 2012. LNCS, pp. 439\u2013454. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_33"},{"key":"22_CR28","unstructured":"Lopez, P.: Energy-based approach for task scheduling under time and resource constraints. Ph.D. thesis, Universit\u00e9 Paul Sabatier-Toulouse III (1991)"},{"issue":"1","key":"22_CR29","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.: Edge finding for cumulative scheduling. INFORMS J. Comput. 20(1), 143\u2013153 (2008). https:\/\/doi.org\/10.1287\/ijoc.1070.0226","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"22_CR30","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s12532-020-00190-7","volume":"13","author":"L Michel","year":"2021","unstructured":"Michel, L., Schaus, P., Van\u00a0Hentenryck, P.: MiniCP: a lightweight solver for constraint programming. Math. Program. Comput. 13(1), 133\u2013184 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00190-7","journal-title":"Math. Program. Comput."},{"key":"22_CR31","unstructured":"MiniZinc Team: MiniZinc Challenge 2022 Results. https:\/\/www.minizinc.org\/challenge2022\/results2022.html"},{"key":"22_CR32","unstructured":"MiniZinc Team: The MiniZinc Benchmark Suite. https:\/\/github.com\/MiniZinc\/minizinc-benchmarks"},{"key":"22_CR33","unstructured":"Nuijten, W.: Time and resource constrained scheduling: a constraint satisfaction approach. Ph.D. thesis, Eindhoven University of Technology (1994)"},{"key":"22_CR34","unstructured":"Nvidia Team: CUDA. https:\/\/developer.nvidia.com\/cuda-toolkit"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-642-40627-0_42","volume-title":"Principles and Practice of Constraint Programming","author":"P Ouellet","year":"2013","unstructured":"Ouellet, P., Quimper, C.-G.: Time-table extended-edge-finding for the cumulative constraint. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 562\u2013577. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_42"},{"key":"22_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/978-3-319-93031-2_34","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"Y Ouellet","year":"2018","unstructured":"Ouellet, Y., Quimper, C.-G.: A $$O(n \\log ^2 n)$$ checker and $$O(n^2 \\log n)$$ filtering algorithm for the energetic reasoning. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 477\u2013494. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-93031-2_34"},{"key":"22_CR37","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2. Elsevier (2006). https:\/\/www.sciencedirect.com\/science\/bookseries\/15746526\/2"},{"key":"22_CR38","unstructured":"Sanders, J., Kandrot, E.: CUDA by Example: An Introduction to General-Purpose GPU Programming. Pearson Education (2010). https:\/\/developer.nvidia.com\/cuda-example"},{"key":"22_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/978-3-642-15396-9_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"A Schutt","year":"2010","unstructured":"Schutt, A., Wolf, A.: A new $${\\cal{O}}(n^2\\log n)$$ not-first\/not-last pruning algorithm for cumulative resource constraints. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 445\u2013459. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_36"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/11963578_6","volume-title":"Declarative Programming for Knowledge Management","author":"A Schutt","year":"2006","unstructured":"Schutt, A., Wolf, A., Schrader, G.: 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.) INAP 2005. LNCS (LNAI), vol. 4369, pp. 66\u201380. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11963578_6"},{"key":"22_CR41","unstructured":"Tardivo, F.: Fzn-minicpp. https:\/\/bitbucket.org\/constraint-programming\/fzn-minicpp"},{"key":"22_CR42","unstructured":"Tardivo, F.: Libfzn. https:\/\/bitbucket.org\/constraint-programming\/libfzn"},{"key":"22_CR43","unstructured":"Tardivo, F.: MiniCPP-Benchmarks. https:\/\/bitbucket.org\/constraint-programming\/minicpp-benchmarks"},{"key":"22_CR44","unstructured":"Tardivo, F., Dovier, A., Formisano, A., Michel, L., Pontelli, E.: Constraints propagation on GPU: a case study for AllDifferent. In: Calegari, R., Ciatto, G., Omicini, A. (eds.) Proceedings of CILC 2022. CEUR Workshop Proceedings, vol. 3204, pp. 61\u201374. CEUR-WS.org (2022)"},{"key":"22_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-319-44953-1_32","volume-title":"Principles and Practice of Constraint Programming","author":"A Tesch","year":"2016","unstructured":"Tesch, A.: A nearly exact propagation algorithm for energetic reasoning in $$\\cal{O}(n^2 \\log n)$$. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 493\u2013519. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_32"},{"key":"22_CR46","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-319-98334-9_41","volume-title":"Principles and Practice of Constraint Programming","author":"A Tesch","year":"2018","unstructured":"Tesch, A.: Improving energetic propagations for cumulative scheduling. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 629\u2013645. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_41"},{"key":"22_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"802","DOI":"10.1007\/978-3-642-04244-7_62","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"P Vil\u00edm","year":"2009","unstructured":"Vil\u00edm, P.: Edge finding filtering algorithm for discrete cumulative resources in $${\\cal{O}}(kn \\, {\\rm log} \\, n)$$. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 802\u2013816. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_62"},{"key":"22_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1007\/978-3-642-21311-3_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"P Vil\u00edm","year":"2011","unstructured":"Vil\u00edm, P.: Timetable edge finding filtering algorithm for discrete cumulative resources. In: Achterberg, T., Beck, J.C. (eds.) CPAIOR 2011. LNCS, vol. 6697, pp. 230\u2013245. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21311-3_22"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:06:42Z","timestamp":1684775202000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":48,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}