{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:36:06Z","timestamp":1742999766553,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":38,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642203633"},{"type":"electronic","value":"9783642203640"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20364-0_9","type":"book-chapter","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T17:21:34Z","timestamp":1303838494000},"page":"96-107","source":"Crossref","is-referenced-by-count":14,"title":["Experiments in Parallel Constraint-Based Local Search"],"prefix":"10.1007","author":[{"given":"Yves","family":"Caniou","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Codognet","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Diaz","sequence":"additional","affiliation":[]},{"given":"Salvador","family":"Abreu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1109\/SAINT.2005.1","volume-title":"SAINT 205: Proceedings of the the 2005 Symposium on Applications and the Internet","author":"K. Aida","year":"2005","unstructured":"Aida, K., Osumi, T.: A case study in running a parallel branch and bound application on the grid. In: SAINT 205: Proceedings of the the 2005 Symposium on Applications and the Internet, pp. 164\u2013173. IEEE Computer Society, Washington, DC, USA (2005)"},{"issue":"3","key":"9_CR2","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1023\/A:1015061802659","volume":"8","author":"R.M. Aiex","year":"2002","unstructured":"Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Probability distribution of solution time in grasp: An experimental investigation. Journal of Heuristics\u00a08(3), 343\u2013373 (2002)","journal-title":"Journal of Heuristics"},{"issue":"40","key":"9_CR3","doi-asserted-by":"publisher","first-page":"15253","DOI":"10.1073\/pnas.0712263105","volume":"105","author":"M. Alava","year":"2007","unstructured":"Alava, M., Ardelius, J., Aurell, E., Kaski, P., Orponen, P., Krishnamurthy, S., Seitz, S.: Circumspect descent prevails in solving random constraint satisfaction problems. PNAS\u00a0105(40), 15253\u201315257 (2007)","journal-title":"PNAS"},{"issue":"3","key":"9_CR4","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1023\/B:HEUR.0000026984.08350.12","volume":"10","author":"E. Alba","year":"2004","unstructured":"Alba, E.: Special issue on new advances on parallel meta-heuristics for complex problems. Journal of Heuristics\u00a010(3), 239\u2013380 (2004)","journal-title":"Journal of Heuristics"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/978-3-540-73370-6_13","volume-title":"Model Checking Software","author":"J. Barnat","year":"2007","unstructured":"Barnat, J., Brim, L., Ro\u010dkai, P.: Scalable multi-core LTL model-checking. In: Bo\u0161na\u010dki, D., Edelkamp, S. (eds.) SPIN 2007. LNCS, vol.\u00a04595, pp. 187\u2013203. Springer, Heidelberg (2007)"},{"issue":"4","key":"9_CR6","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1177\/1094342006070078","volume":"20","author":"R. Bolze","year":"2006","unstructured":"Bolze, R., et al.: Grid 5000: A large scale and highly reconfigurable experimental grid testbed. Int. J. High Perform. Comput. Appl.\u00a020(4), 481\u2013494 (2006)","journal-title":"Int. J. High Perform. Comput. Appl."},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-77220-0_51","volume-title":"High Performance Computing \u2013 HiPC 2007","author":"D. Caromel","year":"2007","unstructured":"Caromel, D., di Costanzo, A., Baduel, L., Matsuoka, S.: Grid\u2019BnB: a parallel branch and bound framework for grids. In: Aluru, S., Parashar, M., Badrinath, R., Prasanna, V.K. (eds.) HiPC 2007. LNCS, vol.\u00a04873, pp. 566\u2013579. Springer, Heidelberg (2007)"},{"key":"9_CR8","unstructured":"Chu, G., Stuckey, P.: A parallelization of MiniSAT 2.0. In: Proceedings of SAT race (2008)"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/3-540-45322-9_5","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"P. Codognet","year":"2001","unstructured":"Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: Steinh\u00f6fel, K. (ed.) SAGA 2001. LNCS, vol.\u00a02264, pp. 73\u201390. Springer, Heidelberg (2001)"},{"key":"9_CR10","unstructured":"Codognet, P., Diaz, D.: An efficient library for solving CSP with local search. In: Ibaraki, T. (ed.) MIC 2003, 5th International Conference on Metaheuristics (2003)"},{"issue":"3","key":"9_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1015084116772","volume":"8","author":"T. Crainic","year":"2002","unstructured":"Crainic, T., Toulouse, M.: Special issue on parallel meta-heuristics. Journal of Heuristics\u00a08(3), 247\u2013388 (2002)","journal-title":"Journal of Heuristics"},{"issue":"3","key":"9_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/B:HEUR.0000026897.40171.1a","volume":"10","author":"T.G. Crainic","year":"2004","unstructured":"Crainic, T.G., Gendreau, M., Hansen, P., Mladenovic, N.: Cooperative parallel variable neighborhood search for the -median. Journal of Heuristics\u00a010(3), 293\u2013314 (2004)","journal-title":"Journal of Heuristics"},{"issue":"3","key":"9_CR13","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/185403.185453","volume":"26","author":"J.C. Kergommeaux de","year":"1994","unstructured":"de Kergommeaux, J.C., Codognet, P.: Parallel logic programming systems. ACM Computing Surveys\u00a026(3), 295\u2013336 (1994)","journal-title":"ACM Computing Surveys"},{"key":"9_CR14","series-title":"Studies in Computational Intelligence","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-642-15211-5_28","volume-title":"Intelligent Distributed Computing IV","author":"D. Diaz","year":"2010","unstructured":"Diaz, D., Abreu, S., Codognet, P.: Parallel constraint-based local search on the cell\/BE multicore architecture. In: Essaaidi, M., Malgeri, M., Badica, C. (eds.) IDC 2010. Studies in Computational Intelligence, vol.\u00a0315, pp. 265\u2013274. Springer, Heidelberg (2010)"},{"key":"9_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-540-30218-6_19","volume-title":"Recent Advances in Parallel Virtual Machine and Message Passing Interface","author":"E. Gabriel","year":"2004","unstructured":"Gabriel, E., et al.: Open MPI: Goals, Concept, and Design of a Next Generation MPI Implementation. In: Kranzlm\u00fcller, D., Kacsuk, P., Dongarra, J. (eds.) EuroPVM\/MPI 2004. LNCS, vol.\u00a03241, pp. 97\u2013104. Springer, Heidelberg (2004)"},{"key":"9_CR16","unstructured":"Galinier, P., Hao, J.-K.: A general approach for constraint solving by local search. In: 2nd Workshop CP-AI-OR 2000, Paderborn, Germany (2000)"},{"issue":"6","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B. Gendron","year":"1994","unstructured":"Gendron, B., Crainic, T.: Parallel branch-and-bound algorithms: Survey and synthesis. Operations Research\u00a042(6), 1042\u20131066 (1994)","journal-title":"Operations Research"},{"key":"9_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1007\/978-3-540-48085-3_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"I.P. Gent","year":"1999","unstructured":"Gent, I.P., Walsh, T.: CSPlib: A benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 480\u2013481. Springer, Heidelberg (1999)"},{"volume-title":"Handbook of Approximation Algorithms and Metaheuristics","year":"2007","key":"9_CR19","unstructured":"Gonzalez, T. (ed.): Handbook of Approximation Algorithms and Metaheuristics. Chapman and Hall \/ CRC, Boca Raton (2007)"},{"key":"9_CR20","doi-asserted-by":"crossref","first-page":"245","DOI":"10.3233\/SAT190070","volume":"6","author":"Y. Hamadi","year":"2009","unstructured":"Hamadi, Y., Jabbour, S., Sais, L.: ManySAT: a parallel SAT solver. Journal on Satisfiability, Boolean Modeling and Computation\u00a06, 245\u2013262 (2009)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9_CR21","volume-title":"Constraint Satisfaction in Logic Programming","author":"P.V. Hentenryck","year":"1989","unstructured":"Hentenryck, P.V.: Constraint Satisfaction in Logic Programming. The MIT Press, Cambridge (1989)"},{"key":"9_CR22","first-page":"165","volume-title":"International Conference on Logic Programming","author":"P.V. Hentenryck","year":"1989","unstructured":"Hentenryck, P.V.: Parallel constraint satisfaction in logic programming: Preliminary results of CHIP within PEPSys. In: International Conference on Logic Programming, pp. 165\u2013180. MIT Press, Cambridge (1989)"},{"key":"9_CR23","volume-title":"Constraint-Based Local Search","author":"P.V. Hentenryck","year":"2005","unstructured":"Hentenryck, P.V., Michel, L.: Constraint-Based Local Search. The MIT Press, Cambridge (2005)"},{"issue":"10","key":"9_CR24","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/TSE.2007.70724","volume":"33","author":"G.J. Holzmann","year":"2007","unstructured":"Holzmann, G.J., Bosnacki, D.: The design of a multicore extension of the spin model checker. IEEE Transactions on Software Engineering\u00a033(10), 659\u2013674 (2007)","journal-title":"IEEE Transactions on Software Engineering"},{"volume-title":"Metaheuristics: Progress as Real Problem Solvers","year":"2005","key":"9_CR25","unstructured":"Ibaraki, T., Nonobe, K., Yagiura, M. (eds.): Metaheuristics: Progress as Real Problem Solvers. Springer, Heidelberg (2005)"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1007\/978-3-642-04244-7_39","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"S. Kadioglu","year":"2009","unstructured":"Kadioglu, S., Sellmann, M.: Dialectic search. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 486\u2013500. Springer, Heidelberg (2009)"},{"key":"9_CR27","volume-title":"Handbook of Satisability","author":"H.A. Kautz","year":"2008","unstructured":"Kautz, H.A., Sabharwal, A., Selman, B.: Incomplete algorithms. In: Biere, A., Heule, M., van Maaren, H., Walsch, T. (eds.) Handbook of Satisability. IOS Press, Amsterdam (2008)"},{"key":"9_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/11889205_26","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"L. Michel","year":"2006","unstructured":"Michel, L., See, A., Van Hentenryck, P.: Distributed constraint-based local search. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 344\u2013358. Springer, Heidelberg (2006)"},{"key":"9_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/978-3-540-74970-7_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"L. Michel","year":"2007","unstructured":"Michel, L., See, A., Van Hentenryck, P.: Parallelizing constraint programs transparently. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 514\u2013528. Springer, Heidelberg (2007)"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/j.cor.2008.08.014","volume":"36","author":"L. Michel","year":"2009","unstructured":"Michel, L., See, A., Van Hentenryck, P.: Parallel and distribited local search in comet. Computers and Operations Research\u00a036, 2357\u20132375 (2009)","journal-title":"Computers and Operations Research"},{"issue":"1-3","key":"9_CR31","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M.D., Philips, A.B., Laird, P.: Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence\u00a058(1-3), 161\u2013205 (1992)","journal-title":"Artificial Intelligence"},{"key":"9_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"524","DOI":"10.1007\/978-3-642-02777-2_47","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"K. Ohmura","year":"2009","unstructured":"Ohmura, K., Ueda, K.: c-SAT: A parallel SAT solver for clusters. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol.\u00a05584, pp. 524\u2013537. Springer, Heidelberg (2009)"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/3-540-60321-2_26","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"P.M. Pardalos","year":"1995","unstructured":"Pardalos, P.M., Pitsoulis, L.S., Mavridou, T.D., Resende, M.G.C.: Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP. In: Ferreira, A., Rolim, J.D.P. (eds.) IRREGULAR 1995. LNCS, vol.\u00a0980, pp. 317\u2013331. Springer, Heidelberg (1995)"},{"key":"9_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1007\/978-3-540-48085-3_25","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"L. Perron","year":"1999","unstructured":"Perron, L.: Search procedures and parallelism in constraint programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 346\u2013360. Springer, Heidelberg (1999)"},{"key":"9_CR35","doi-asserted-by":"crossref","first-page":"203","DOI":"10.3233\/SAT190068","volume":"6","author":"T. Schubert","year":"2009","unstructured":"Schubert, T., Lewis, M.D.T., Becker, B.: Pamiraxt: Parallel sat solving with threads and message passing. Journal on Satisfiability, Boolean Modeling and Computation\u00a06, 203\u2013222 (2009)","journal-title":"Journal on Satisfiability, Boolean Modeling and Computation"},{"key":"9_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-642-12139-5_23","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"T. Luong Van","year":"2010","unstructured":"Van Luong, T., Melab, N., Talbi, E.-G.: Local search algorithms on graphics processing units. In: Cowling, P., Merz, P. (eds.) EvoCOP 2010. LNCS, vol.\u00a06022, pp. 264\u2013275. Springer, Heidelberg (2010)"},{"issue":"1","key":"9_CR37","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/BF02430365","volume":"1","author":"M. Verhoeven","year":"1995","unstructured":"Verhoeven, M., Aarts, E.: Parallel local search. Journal of Heuristics\u00a01(1), 43\u201365 (1995)","journal-title":"Journal of Heuristics"},{"issue":"5","key":"9_CR38","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1109\/69.729707","volume":"10","author":"M. Yokoo","year":"1998","unstructured":"Yokoo, M., Durfee, E.H., Ishida, T., Kuwabara, K.: The distributed constraint satisfaction problem: Formalization and algorithms. IEEE Transactions on Knowledge and Data Engineering\u00a010(5), 673\u2013685 (1998)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-20364-0_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,18]],"date-time":"2020-06-18T16:46:30Z","timestamp":1592498790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20364-0_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642203633","9783642203640"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20364-0_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}