{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T11:01:36Z","timestamp":1775818896540,"version":"3.50.1"},"publisher-location":"Cham","reference-count":103,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319635156","type":"print"},{"value":"9783319635163","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-63516-3_9","type":"book-chapter","created":{"date-parts":[[2018,4,5]],"date-time":"2018-04-05T03:43:39Z","timestamp":1522899819000},"page":"337-379","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Parallel Constraint Programming"],"prefix":"10.1007","author":[{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arnaud","family":"Malapert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,6]]},"reference":[{"key":"9_CR1","unstructured":"16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2004), 15-17 November 2004, Boca Raton, FL, USA. IEEE Computer Society (2004). http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=9460"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Amadini, R., Gabbrielli, M., Mauro, J.: An Empirical Evaluation of Portfolios Approaches for Solving CSPs. In: C. Gomes, M. Sellmann (eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, vol. 7874, pp. 316\u2013324. Springer Berlin Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38171-3_21 . http:\/\/dx.doi.org\/10.1007\/978-3-642-38171-3_21","DOI":"10.1007\/978-3-642-38171-3_21"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Amdahl, G.: Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities. In: Proceedings of the April 18-20, 1967, Spring Joint Computer Conference, AFIPS \u201967, pp. 483\u2013485. ACM, New York, NY, USA (1967)","DOI":"10.1145\/1465482.1465560"},{"key":"9_CR4","doi-asserted-by":"publisher","unstructured":"Bader, D., Hart, W., Phillips, C.: Parallel Algorithm Design for Branch and Bound. In: H. G (ed.) Tutorials on Emerging Methodologies and Applications in Operations Research, International Series in Operations Research & Management Science, vol. 76, pp. 5\u20131\u20135\u201344. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-22827-6_5","DOI":"10.1007\/0-387-22827-6_5"},{"key":"9_CR5","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H.: Experiments with Massively Parallel Constraint Solving. In: Boutilier [8], pp. 443\u2013448"},{"key":"9_CR6","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H.: Experiments with massively parallel constraint solving. In: Boutilier [8], pp. 443\u2013448"},{"key":"9_CR7","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: ECAI, vol. 16, p. 146 (2004)"},{"key":"9_CR8","unstructured":"Boutilier, C. (ed.): IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, July 11-17, 2009 (2009)"},{"key":"9_CR9","unstructured":"Budiu, M., Delling, D., Werneck, R.: DryadOpt: Branch-and-bound on distributed data-parallel execution engines. In: Parallel and Distributed Processing Symposium (IPDPS), 2011 IEEE International, pp. 1278\u20131289 (2011)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Burton, F.W., Sleep, M.R.: Executing Functional Programs on a Virtual Tree of Processors. In: Proceedings of the 1981 Conference on Functional Programming Languages and Computer Architecture, FPCA \u201981, pp. 187\u2013194. ACM, New York, NY, USA (1981)","DOI":"10.1145\/800223.806778"},{"key":"9_CR11","unstructured":"Capit, N., Da Costa, G., Georgiou, Y., Huard, G., Martin, C., Mounie, G., Neyron, P., Richard, O.: A Batch Scheduler with High Level Components. In: Proceedings of the Fifth IEEE International Symposium on Cluster Computing and the Grid (CCGrid\u201905) - Volume 2 - Volume 02, CCGRID \u201905, pp. 776\u2013783. IEEE Computer Society, Washington, DC, USA (2005). http:\/\/dl.acm.org\/citation.cfm?id=1169223.1169583"},{"key":"9_CR12","unstructured":"Choco, T.: Choco: an open source java constraint programming library. Ecole des Mines de Nantes, Research report 1, 10\u201302 (2010)"},{"key":"9_CR13","unstructured":"Choco solver http:\/\/www.emn.fr\/z-info\/choco-solver\/ (2013)."},{"key":"9_CR14","unstructured":"Chong, Y.L., Hamadi, Y.: Distributed Log-Based Reconciliation. In: Proceedings of the 2006 Conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 \u2013 September 1, 2006, Riva Del Garda, Italy, pp. 108\u2013112. IOS Press, Amsterdam, The Netherlands (2006). http:\/\/dl.acm.org\/citation.cfm?id=1567016.1567045"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-Based Work Stealing in Parallel Constraint Programming. In: Gent [27], pp. 226\u2013241","DOI":"10.1007\/978-3-642-04244-7_20"},{"key":"9_CR16","doi-asserted-by":"crossref","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-based work stealing in parallel constraint programming. In: Gent [27], pp. 226\u2013241","DOI":"10.1007\/978-3-642-04244-7_20"},{"key":"9_CR17","unstructured":"Cire, A.A., Kadioglu, S., Sellmann, M.: Parallel Restarted Search. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, AAAI\u201914, pp. 842\u2013848. AAAI Press (2014). http:\/\/dl.acm.org\/citation.cfm?id=2893873.2894004"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Karamanov, M., Li, Y.: Early estimates of the size of branchand-bound trees. INFORMS Journal on Computing 18(1), 86\u201396 (2006)","DOI":"10.1287\/ijoc.1040.0107"},{"key":"9_CR19","doi-asserted-by":"crossref","unstructured":"Cornu\u00e9jols, G., Karamanov, M., Li, Y.: Early Estimates of the Size of Branchand-Bound Trees. INFORMS Journal on Computing 18, 86\u201396 (2006)","DOI":"10.1287\/ijoc.1040.0107"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Crainic, T.G., Le Cun, B., Roucairol, C.: Parallel branch-and-bound algorithms. Parallel Combinatorial Optimization 1, 1\u201328 (2006)","DOI":"10.1002\/9780470053928.ch1"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"De Kergommeaux, J.C., Codognet, P.: Parallel logic programming systems. ACM Computing Surveys (CSUR) 26(3), 295\u2013336 (1994)","DOI":"10.1145\/185403.185453"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"De Nicola, R., Ferrari, G.L., Meredith, G. (eds.): Coordination Models and Languages, 6th International Conference, COORDINATION 2004, Pisa, Italy, February 24-27, 2004, Proceedings, Lecture Notes in Computer Science, vol. 2949. Springer (2004)","DOI":"10.1007\/b95570"},{"key":"9_CR23","unstructured":"Ezzahir, R., Bessi\u00e8re, C., Belaissaoui, M., Bouyakhf, E.H.: DisChoco: A platform for distributed constraint programming. In: DCR\u201907: Eighth International Workshop on Distributed Constraint Reasoning - In conjunction with IJCAI\u201907, pp. 16\u201321. Hyderabad, India (2007). https:\/\/hal-lirmm.ccsd.cnrs.fr\/lirmm-00189778"},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Fischetti, M., Monaci, M., Salvagnin, D.: Self-splitting of workload in parallel computation. In: H. Simonis (ed.) Integration of AI and OR Techniques in Constraint Programming: 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings, pp. 394\u2013404. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07046-9_28 . http:\/\/dx.doi.org\/10.1007\/978-3-319-07046-9_28","DOI":"10.1007\/978-3-319-07046-9_28"},{"key":"9_CR25","unstructured":"Galea F., Le Cun, B.: Bob++ : a Framework for Exact Combinatorial Optimization Methods on Parallel Machines. In: International Conference High Performance Computing & Simulation 2007 (HPCS\u201907) and in conjunction with The 21st European Conference on Modeling and Simulation (ECMS 2007), pp. 779\u2013785 (2007)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Gendron, B., Crainic, T.G.: Parallel branch-and-bound algorithms: Survey and synthesis. Operations research 42(6), 1042\u20131066 (1994)","DOI":"10.1287\/opre.42.6.1042"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Gent, I.P. (ed.): Principles and Practice of Constraint Programming - CP 2009, 15th International Conference, CP 2009, Lisbon, Portugal, September 20-24, 2009, Proceedings, Lecture Notes in Computer Science, vol. 5732 (2009)","DOI":"10.1007\/978-3-642-04244-7"},{"key":"9_CR28","unstructured":"Gomes, C., Selman, B.: Algorithm Portfolio Design: Theory vs. Practice. In: Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, pp. 190\u2013197 (1997)"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Gomes, C., Selman, B.: Search strategies for hybrid search spaces. In: Tools with Artificial Intelligence, 1999. Proceedings. 11th IEEE International Conference, pp. 359\u2013364. IEEE (1999)","DOI":"10.1109\/TAI.1999.809823"},{"key":"9_CR30","doi-asserted-by":"crossref","unstructured":"Gomes, C., Selman, B.: Hybrid Search Strategies For Heterogeneous Search Spaces. International Journal on Artificial Intelligence Tools 09, 45\u201357 (2000)","DOI":"10.1142\/S0218213000000057"},{"key":"9_CR31","doi-asserted-by":"crossref","unstructured":"Gomes, C., Selman, B.: Algorithm Portfolios. Artificial Intelligence 126, 43\u201362 (2001)","DOI":"10.1016\/S0004-3702(00)00081-3"},{"key":"9_CR32","doi-asserted-by":"crossref","unstructured":"Gropp,W., Lusk, E.: TheMPI communication library: its design and a portable implementation. In: Scalable Parallel Libraries Conference, Proceedings of the, pp. 160\u2013165. IEEE (1993)","DOI":"10.1109\/SPLC.1993.365571"},{"key":"9_CR33","doi-asserted-by":"crossref","unstructured":"Gupta, G., Pontelli, E., Ali, K.A., Carlsson, M., Hermenegildo, M.V.: Parallel execution of Prolog Programs: a Survey. ACM Transactions on Programming Languages and Systems (TOPLAS) 23(4), 472\u2013602 (2001)","DOI":"10.1145\/504083.504085"},{"key":"9_CR34","doi-asserted-by":"crossref","unstructured":"Halstead, R.: Implementation of MultiLisp: Lisp on a Multiprocessor. In: Proceedings of the 1984 ACM Symposium on LISP and Functional Programming, LFP \u201984, pp. 9\u201317. ACM, New York, NY, USA (1984)","DOI":"10.1145\/800055.802017"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Hamadi, Y.: Optimal Distributed Arc-Consistency. Constraints 7, 367\u2013385 (2002)","DOI":"10.1023\/A:1020594125144"},{"key":"9_CR36","doi-asserted-by":"crossref","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a Parallel SAT Solver. Journal on Satisfiability, Boolean Modeling and Computation 6(4), 245\u2013262 (2008)","DOI":"10.3233\/SAT190070"},{"key":"9_CR37","doi-asserted-by":"crossref","unstructured":"Haralick, R., Elliot, G.: Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence 14, 263\u2013313 (1980)","DOI":"10.1016\/0004-3702(80)90051-X"},{"key":"9_CR38","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited Discrepancy Search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montr\u00e9al, Qu\u00e9bec, Canada, August 20-25 1995, 2 Volumes, pp. 607\u2013615 (1995)"},{"key":"9_CR39","doi-asserted-by":"crossref","unstructured":"Hirayama, K., Yokoo, M.: Distributed Partial Constraint Satisfaction Problem. In: Principles and Practice of Constraint Programming-CP97, pp. 222\u2013236. Springer (1997)","DOI":"10.1007\/BFb0017442"},{"key":"9_CR40","unstructured":"Hyde, P.: Java thread programming, vol. 1. Sams (1999)"},{"key":"9_CR41","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Santosa, A.E., Yap, R.H.C., Zhu, K.Q.: Scalable Distributed Depth-First Search with Greedy Work Stealing. In: 16th IEEE International Conference on Tools with Artificial Intelligence [1], pp. 98\u2013103. http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=9460","DOI":"10.1109\/ICTAI.2004.107"},{"key":"9_CR42","doi-asserted-by":"crossref","unstructured":"Jaffar, J., Santosa, A.E., Yap, R.H.C., Zhu, K.Q.: Scalable distributed depth-first search with greedy work stealing. In: ICTAI [1], pp. 98\u2013103. http:\/\/ieeexplore.ieee.org\/xpl\/mostRecentIssue.jsp?punumber=9460","DOI":"10.1109\/ICTAI.2004.107"},{"key":"9_CR43","doi-asserted-by":"crossref","unstructured":"Kale, L., Krishnan, S.: CHARM++: a portable concurrent object oriented system based on C++, vol. 28. ACM (1993)","DOI":"10.1145\/165854.165874"},{"key":"9_CR44","doi-asserted-by":"crossref","unstructured":"Kasif, S.: On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction networks. Artificial Intelligence 45, 275\u2013286 (1990)","DOI":"10.1016\/0004-3702(90)90009-O"},{"key":"9_CR45","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic Restart Policies. 18th National Conference on Artificial Intelligence AAAI\/IAAI 97, 674\u2013681 (2002)"},{"key":"9_CR46","unstructured":"Kilby, P., Slaney, J.K., Thi\u00e9baux, S., Walsh, T.: Estimating search tree size. In: AAAI, pp. 1014\u20131019 (2006)"},{"key":"9_CR47","unstructured":"Kjellerstrand, H.: H\u00e5kan Kjellerstrand\u2019s Blog. http:\/\/www.hakank.org\/ (2014)"},{"key":"9_CR48","unstructured":"Kleiman, S., Shah, D., Smaalders, B.: Programming with threads. Sun Soft Press (1996)"},{"key":"9_CR49","doi-asserted-by":"crossref","unstructured":"Knuth, D.E.: Estimating the efficiency of backtrack programs. Mathematics of Computation 29, 121\u2013136 (1975)","DOI":"10.2307\/2005469"},{"key":"9_CR50","doi-asserted-by":"crossref","unstructured":"Korf, R.: Depth-first iterative-deepening: An optimal admissible tree search. Artificial Intelligence 27, 97\u2013109 (1985)","DOI":"10.1016\/0004-3702(85)90084-0"},{"key":"9_CR51","doi-asserted-by":"crossref","unstructured":"Kowalski, R.: Algorithm = logic + control. Commun. ACM 22(7), 424\u2013436 (1979)","DOI":"10.1145\/359131.359136"},{"key":"9_CR52","unstructured":"Le Cun, B., Menouer, T., Vander-Swalmen, P.: Bobpp. http:\/\/forge.prism.uvsq.fr\/projects\/bobpp (2007)"},{"key":"9_CR53","unstructured":"L\u00e9aut\u00e9, T., Ottens, B., Szymanek, R.: FRODO 2.0: An open-source framework for distributed constraint optimization. In: Boutilier [8], pp. 160\u2013164"},{"key":"9_CR54","doi-asserted-by":"crossref","unstructured":"Leiserson, C.E.: The Cilk++ concurrency platform. The Journal of Supercomputing 51(3), 244\u2013257 (2010)","DOI":"10.1007\/s11227-010-0405-3"},{"key":"9_CR55","unstructured":"Lester, B.: The art of parallel programming. Prentice Hall, Englewood Cliffs, NJ (1993)"},{"key":"9_CR56","doi-asserted-by":"crossref","unstructured":"Li, H.: Introducing Windows Azure. Apress, Berkeley, CA, USA (2009)","DOI":"10.1007\/978-1-4302-2470-9"},{"key":"9_CR57","doi-asserted-by":"crossref","unstructured":"Lodi, A., Milano, M., Toth, P. (eds.): Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 7th International Conference, CPAIOR 2010, Bologna, Italy, June 14-18, 2010. Proceedings, Lecture Notes in Computer Science, vol. 6140. Springer (2010)","DOI":"10.1007\/978-3-642-13520-0"},{"key":"9_CR58","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal Speedup of Las Vegas Algorithms. Inf. Process. Lett. 47, 173\u2013180 (1993)"},{"key":"9_CR59","doi-asserted-by":"crossref","unstructured":"Machado, R., Pedro, V., Abreu, S.: On the Scalability of Constraint Programming on Hierarchical Multiprocessor Systems. In: ICPP, pp. 530\u2013535. IEEE (2013)","DOI":"10.1109\/ICPP.2013.66"},{"key":"9_CR60","unstructured":"Malapert, A., Lecoutre, C.: \u00c0 propos de la biblioth\u00e8que de mod\u00e8les XCSP. In: 10\u00e8mes Journ\u00e9es Francophones de Programmation par Contraintes (JFPC\u201915). Angers, France (2014)"},{"key":"9_CR61","doi-asserted-by":"publisher","unstructured":"Malapert, A., R\u00e9gin, J., Rezgui, M.: Embarrassingly parallel search in constraint programming. J. Artif. Intell. Res. (JAIR) 57, 421\u2013464 (2016). https:\/\/doi.org\/10.1613\/jair.5247 . http:\/\/dx.doi.org\/10.1613\/jair.5247","DOI":"10.1613\/jair.5247"},{"key":"9_CR62","unstructured":"Menouer, T.: Parall\u00e9lisations de M\u00e9thodes de Programmation Par Contraintes. Ph.D. thesis, Universit\u00e9 de Versailles Saint-Quentin-en-Yvelines (2015)"},{"key":"9_CR63","doi-asserted-by":"publisher","unstructured":"Menouer, T., Cun, B.L.: Anticipated dynamic load balancing strategy to parallelize constraint programming search. In: 2013 IEEE 27th International Symposium on Parallel and Distributed ProcessingWorkshops and PhD Forum, pp. 1771\u20131777 (2013). https:\/\/doi.org\/10.1109\/ipdpsw.2013.210 . http:\/\/doi.ieeecomputersociety.org\/10.1109\/IPDPSW.2013.210","DOI":"10.1109\/ipdpsw.2013.210"},{"key":"9_CR64","doi-asserted-by":"crossref","unstructured":"Menouer, T., Le Cun, B.: Anticipated Dynamic Load Balancing Strategy to Parallelize Constraint Programming Search. In: 2013 IEEE 27th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum, pp. 1771\u20131777 (2013)","DOI":"10.1109\/IPDPSW.2013.210"},{"key":"9_CR65","doi-asserted-by":"crossref","unstructured":"Menouer, T., Le Cun, B.: Adaptive N To P Portfolio for Solving Constraint Programming Problems on Top of the Parallel Bobpp Framework. In: 2014 IEEE 28th International Symposium on Parallel and Distributed Processing Workshops and PhD Forum (2014)","DOI":"10.1109\/IPDPSW.2014.171"},{"key":"9_CR66","doi-asserted-by":"publisher","unstructured":"Menouer, T., Rezgui, M., Cun, B.L., R\u00e9gin, J.: Mixing static and dynamic partitioning to parallelize a constraint programming solver. International Journal of Parallel Programming 44(3), 486\u2013505 (2016). https:\/\/doi.org\/10.1007\/s10766-015-0356-7 . http:\/\/dx.doi.org\/10.1007\/s10766-015-0356-7","DOI":"10.1007\/s10766-015-0356-7"},{"key":"9_CR67","doi-asserted-by":"crossref","unstructured":"Michel, L., See, A., Hentenryck, P.V.: Transparent parallelization of constraint programming. INFORMS Journal on Computing 21(3), 363\u2013382 (2009)","DOI":"10.1287\/ijoc.1080.0313"},{"key":"9_CR68","doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp. 228\u2013243. Springer (2012)","DOI":"10.1007\/978-3-642-29828-8_15"},{"key":"9_CR69","unstructured":"Microsoft Corporation: Microsoft HPC Pack 2012 R2 and HPC Pack 2012. http:\/\/technet.microsoft.com\/en-us\/library\/jj899572.aspx (2015)"},{"key":"9_CR70","unstructured":"Minizinc challenge http:\/\/www.minizinc.org\/challenge2012\/challenge.html (2012). Accessed: 14-04-2014"},{"key":"9_CR71","doi-asserted-by":"crossref","unstructured":"Moisan, T., Gaudreault, J., Quimper, C.G.: Parallel Discrepancy-Based Search. In: Principles and Practice of Constraint Programming, Lecture Notes in Computer Science, vol. 8124, pp. 30\u201346. Springer (2013)","DOI":"10.1007\/978-3-642-40627-0_6"},{"key":"9_CR72","doi-asserted-by":"publisher","unstructured":"Moisan, T., Quimper, C.G., Gaudreault, J.: Parallel Depth-bounded Discrepancy Search. In: H. Simonis (ed.) Integration of AI and OR Techniques in Constraint Programming: 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. Proceedings, pp. 377\u2013393. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07046-9_27 . http:\/\/dx.doi.org\/10.1007\/978-3-319-07046-9_27","DOI":"10.1007\/978-3-319-07046-9_27"},{"key":"9_CR73","unstructured":"Mueller, F., et al.: A Library Implementation of POSIX Threads under UNIX. In: USENIX Winter, pp. 29\u201342 (1993)"},{"key":"9_CR74","doi-asserted-by":"crossref","unstructured":"Nguyen, T., Deville, Y.: A Distributed Arc-Consistency Algorithm. Science of Computer Programming 30(1\u20132), 227 \u2013 250 (1998). http:\/\/dx.doi.org\/10.1016\/S0167-6423(97)00012-9 . http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0167642397000129 . Concurrent Constraint Programming","DOI":"10.1016\/S0167-6423(97)00012-9"},{"key":"9_CR75","unstructured":"NICTA Optimisation Research Group: MiniZinc and FlatZinc. http:\/\/www.g12.csse.unimelb.edu.au\/minizinc\/ (2012)"},{"key":"9_CR76","unstructured":"Nielsen, M.: Parallel Search in Gecode. Master\u2019s thesis, KTH Royal Institute of Technology (2006)"},{"key":"9_CR77","unstructured":"O\u2019Mahony, E., Hebrard, E., Holland, A., Nugent, C., O\u2019Sullivan, B.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science, pp. 210\u2013216 (2008)"},{"key":"9_CR78","doi-asserted-by":"publisher","unstructured":"Palmieri, A., R\u00e9gin, J., Schaus, P.: Parallel strategies selection. In: M. Rueher (ed.) Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings, Lecture Notes in Computer Science, vol. 9892, pp. 388\u2013404. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_25 . http:\/\/dx.doi.org\/10.1007\/978-3-319-44953-1_25","DOI":"10.1007\/978-3-319-44953-1_25"},{"key":"9_CR79","doi-asserted-by":"publisher","unstructured":"Perron, L.: Search Procedures and Parallelism in Constraint Programming. In: Principles and Practice of Constraint Programming \u2013 CP\u201999: 5th International Conference, CP\u201999, Alexandria, VA, USA, October 11-14, 1999. Proceedings, pp. 346\u2013360. Springer Berlin Heidelberg, Berlin, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-48085-3_25 . http:\/\/dx.doi.org\/10.1007\/978-3-540-48085-3_25","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"9_CR80","doi-asserted-by":"crossref","unstructured":"Perron, L.: Search procedures and parallelism in constraint programming. In: CP, Lecture Notes in Computer Science, vol. 1713, pp. 346\u2013360 (1999)","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"9_CR81","unstructured":"Perron, L., Nikolaj, V.O., Vincent, F.: Or-Tools. Tech. rep., Google (2012)"},{"key":"9_CR82","doi-asserted-by":"crossref","unstructured":"Pruul, E., Nemhauser, G., Rushmeier, R.: Branch-and-bound and Parallel Computation: A historical note. Operations Research Letters 7, 65\u201369 (1988)","DOI":"10.1016\/0167-6377(88)90067-3"},{"key":"9_CR83","unstructured":"cois Puget, J.F.: ILOG CPLEX CP Optimizer : A C++ implementation of CLP. http:\/\/www.ilog.com\/ (1994)"},{"key":"9_CR84","doi-asserted-by":"crossref","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: M. Wallace (ed.) CP, Lecture Notes in Computer Science, vol. 3258, pp. 557\u2013571. Springer (2004)","DOI":"10.1007\/978-3-540-30201-8_41"},{"key":"9_CR85","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings AAAI-94, pp. 362\u2013367. Seattle, Washington (1994)"},{"key":"9_CR86","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.C.: Global Constraints: a Survey. In Milano, M., Van-Hentenryck, P. eds., Hybrid Optimization. Springer (2011)","DOI":"10.1007\/978-1-4419-1644-0_3"},{"key":"9_CR87","doi-asserted-by":"publisher","unstructured":"R\u00e9gin, J.C., Rezgui, M., Malapert, A.: Embarrassingly Parallel Search. In: Principles and Practice of Constraint Programming: 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, pp. 596\u2013610. Springer Berlin Heidelberg, Berlin, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_45 . http:\/\/dx.doi.org\/10.1007\/978-3-642-40627-0_45","DOI":"10.1007\/978-3-642-40627-0_45"},{"key":"9_CR88","doi-asserted-by":"publisher","unstructured":"R\u00e9gin, J.C., Rezgui, M., Malapert, A.: Improvement of the Embarrassingly Parallel Search for Data Centers. In: B. O\u2019Sullivan (ed.) Principles and Practice of Constraint Programming: 20th International Conference, CP 2014, Lyon, France, September 8-12, 2014. Proceedings, Lecture Notes in Computer Science, vol. 8656, pp. 622\u2013635. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_45 . http:\/\/dx.doi.org\/10.1007\/978-3-319-10428-7_45","DOI":"10.1007\/978-3-319-10428-7_45"},{"key":"9_CR89","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: The discoveries of continuations. Lisp and Symbolic Computation. 6(3\/4), 233\u2013248. (1993)","DOI":"10.1007\/BF01019459"},{"key":"9_CR90","unstructured":"Rezgui, M., R\u00e9gin, J.C., Malapert, A.: Using Cloud Computing for Solving Constraint Programming Problems. In: First Workshop on Cloud Computing and Optimization, a conference workshop of CP 2014. Lyon, France (2014)"},{"key":"9_CR91","unstructured":"Rolf, C.C., Kuchcinski, K.: Parallel Consistency in Constraint Programming. PDPTA \u201909: The 2009 International Conference on Parallel and Distributed Processing Techniques and Applications 2, 638\u2013644 (2009)"},{"key":"9_CR92","unstructured":"Roussel, O., Lecoutre, C.: Xml representation of constraint networks format. http:\/\/www.cril.univ-artois.fr\/CPAI08\/XCSP2_1Competition.pdf (2008)"},{"key":"9_CR93","unstructured":"Schaus, P.: Oscar, Operational Research in Scala. https:\/\/bitbucket.org\/oscarlib\/oscar\/wiki\/Home"},{"key":"9_CR94","unstructured":"Schulte, C.: Parallel Search Made Simple. In Proceedings of TRICS: Techniques foR Implementing Constraint programming Systems, a post-conference workshop of CP 2000, pp. 41\u201357. Singapore (2000)"},{"key":"9_CR95","unstructured":"Schulte, C.: Gecode: Generic Constraint Development Environment. http:\/\/www.gecode.org\/ (2006)"},{"key":"9_CR96","doi-asserted-by":"publisher","unstructured":"Van Hentenryck, P., Michel, L.: The objective-CP optimization system. In: C. Schulte (ed.) Principles and Practice of Constraint Programming - 19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings, Lecture Notes in Computer Science, vol. 8124, pp. 8\u201329. Springer (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_5 . http:\/\/dx.doi.org\/10.1007\/978-3-642-40627-0_5","DOI":"10.1007\/978-3-642-40627-0_5"},{"key":"9_CR97","doi-asserted-by":"crossref","unstructured":"Vidal, V., Bordeaux, L., Hamadi, Y.: Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning. In: Proceedings of the Third International Symposium on Combinatorial Search. AAAI Press (2010)","DOI":"10.1609\/socs.v1i1.18165"},{"key":"9_CR98","unstructured":"Wahbi, M., Ezzahir, R., Bessiere, C., Bouyakhf, E.H.: DisChoco 2: A Platform for Distributed Constraint Reasoning. In: Proceedings of the IJCAI\u201911 workshop on Distributed Constraint Reasoning, DCR\u201911, pp. 112\u2013121. Barcelona, Catalonia, Spain (2011)"},{"key":"9_CR99","unstructured":"Wilkinson, B., Allen, M.: Parallel Programming: Techniques and Application Using Networked Workstations and Parallel Computers, 2nd edition, Prentice-Hall Inc. (2005)"},{"key":"9_CR100","unstructured":"Xie, F., Davenport, A.: Solving scheduling problems using parallel messagepassing based constraint programming. In: Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems COPLAS, pp. 53\u201358 (2009)"},{"key":"9_CR101","doi-asserted-by":"crossref","unstructured":"Xie, F., Davenport, A.J.: Massively parallel constraint programming for supercomputers: Challenges and initial results. In: Lodi et al. [57], pp. 334\u2013338","DOI":"10.1007\/978-3-642-13520-0_36"},{"key":"9_CR102","unstructured":"Yokoo, M., Ishida, T., Kuwabara, K.: Distributed Constraint Satisfaction for DAI Problems. In: Proceedings of the 1990 Distributed AIWorkshop. Bandara, TX (1990)"},{"key":"9_CR103","doi-asserted-by":"crossref","unstructured":"Zoeteweij, P., Arbab, F.: A component-based parallel constraint solver. In: De Nicola et al. [22], pp. 307\u2013322","DOI":"10.1007\/978-3-540-24634-3_23"}],"container-title":["Handbook of Parallel Constraint Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-63516-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T12:49:11Z","timestamp":1751546951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-63516-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319635156","9783319635163"],"references-count":103,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-63516-3_9","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}