{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:13:48Z","timestamp":1674850428781},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,18]],"date-time":"2015-03-18T00:00:00Z","timestamp":1426636800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10766-015-0356-7","type":"journal-article","created":{"date-parts":[[2015,3,17]],"date-time":"2015-03-17T16:39:54Z","timestamp":1426610394000},"page":"486-505","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Mixing Static and Dynamic Partitioning to Parallelize a Constraint Programming Solver"],"prefix":"10.1007","volume":"44","author":[{"given":"Tarek","family":"Menouer","sequence":"first","affiliation":[]},{"given":"Mohamed","family":"Rezgui","sequence":"additional","affiliation":[]},{"given":"Bertrand","family":"Le Cun","sequence":"additional","affiliation":[]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,18]]},"reference":[{"key":"356_CR1","doi-asserted-by":"crossref","unstructured":"Acar, U.A., Blelloch, G.E., Blumofe, R.D.: The data locality of work stealing. In: Proceedings of the Twelfth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA \u201900), pp. 1\u201312. ACM, New York, NY, USA (2000)","DOI":"10.1145\/341800.341801"},{"key":"356_CR2","doi-asserted-by":"crossref","unstructured":"Alfonso Ferreira, P.M.P.: Solving Combinatorial Optimization Problems in Parallel Methods and Techniques. Lecture Notes in Computer Science, vol. 1054 edition. Springer, Berlin (1996)","DOI":"10.1007\/BFb0027114"},{"key":"356_CR3","doi-asserted-by":"crossref","unstructured":"Baptiste, P., Pape, C.L., Nuijten, W.: Constraint-based scheduling\u2014applying constraint programming to scheduling problems. In: International Series in Operations Research and Management Science, Paris, volume 39, Springer edition (2001)","DOI":"10.1007\/978-1-4615-1479-4"},{"issue":"5","key":"356_CR4","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1145\/324133.324234","volume":"46","author":"RD Blumofe","year":"1999","unstructured":"Blumofe, R.D., Leiserson, C.E.: Scheduling multithreaded computations by work stealing. J. ACM 46(5), 720\u2013748 (1999)","journal-title":"J. ACM"},{"key":"356_CR5","unstructured":"Bordeaux, L., Hamadi, Y., Samulowitz, H.: Experiments with massively parallel constraint solving. In: IJCAI, pp. 443\u2013448 (2009)"},{"key":"356_CR6","unstructured":"Choco solver http:\/\/www.emn.fr\/z-info\/choco-solver\/ . Accessed 14 April 2014 (2013)"},{"key":"356_CR7","doi-asserted-by":"crossref","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-based work stealing in parallel constraint programming. In: Principles and Practice of Constraint Programming (CP 2009), pp. 226\u2013241. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-04244-7_20"},{"key":"356_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4613-3400-2_1","volume-title":"Parallel Computing in Optimization","author":"A Ferreira","year":"1997","unstructured":"Ferreira, A., Morvan, M.: Models for parallel algorithm design: an introduction. In: Migdalas, A., Pardalos, P., Storoy, S. (eds.) Parallel Computing in Optimization, pp. 1\u201326. Kluwer, Boston (1997)"},{"issue":"06","key":"356_CR9","doi-asserted-by":"crossref","first-page":"1042","DOI":"10.1287\/opre.42.6.1042","volume":"42","author":"B Gendron","year":"1994","unstructured":"Gendron, B., Crainic, T.G.: Parallel branch-and-bound algorithms: survey and synthesis. Oper. Res. 42(06), 1042\u20131066 (1994)","journal-title":"Oper. Res."},{"key":"356_CR10","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":"356_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60321-2_1","volume-title":"Parallel Algorithms for Irregularly Structured Problems","author":"T Gautier","year":"1995","unstructured":"Gautier, T., Roch, J., Villard, G.: Regular versus irregular problems and algorithms. In: Ferreira, A., Rolim, J. (eds.) Parallel Algorithms for Irregularly Structured Problems. Lecture Notes in Computer Science, vol. 980, pp. 1\u201325. Springer, Berlin (1995)"},{"key":"356_CR12","unstructured":"Glucose sat solver https:\/\/www.lri.fr\/simon\/?page=glucose . Accessed 14 April 2014"},{"key":"356_CR13","doi-asserted-by":"crossref","unstructured":"Guo, Y., Zhao, J., Cave, V., Sarkar, V.: Slaw: a scalable locality-aware adaptive work-stealing scheduler. In: 2010 IEEE International Symposium on Parallel Distributed Processing (IPDPS), pp. 1\u201312 (2010)","DOI":"10.1109\/IPDPS.2010.5470425"},{"key":"356_CR14","unstructured":"Gent, I.P., Jefferson, C., Miguel, I., Moore, N.C., Nightingale, P., Prosser, P., Unsworth, C.: A preliminary review of literature on parallel constraint solving. In: Proceedings PMCS\u201911 Workshop on Parallel Methods for Constraint Solving (2011)"},{"key":"356_CR15","doi-asserted-by":"crossref","unstructured":"Hurley, B., Kotthoff, L., Malitsky, Y., O\u2019Sullivan, B.: Proteus: A Hierarchical Portfolio of Solvers and Transformations. arXiv preprint arXiv:1306.5606 (2013)","DOI":"10.1007\/978-3-319-07046-9_22"},{"key":"356_CR16","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, pp. 98\u2013103 (2004)","DOI":"10.1109\/ICTAI.2004.107"},{"issue":"1","key":"356_CR17","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"RE Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative-deepening: an optimal admissible tree search. Artif. Intell. 27(1), 97\u2013109 (1985)","journal-title":"Artif. Intell."},{"key":"356_CR18","unstructured":"Le Cun, B., Menouer, T., Vander-Swalmen, P.: Bobpp. http:\/\/forge.prism.uvsq.fr\/projects\/bobpp . Accessed 14 April 2014"},{"key":"356_CR19","doi-asserted-by":"crossref","unstructured":"Matteo Fischetti, M.M., Salvagnin, D.: Self-splitting of workload in parallel computation. In: CPAIOR\u201914 (2014)","DOI":"10.1007\/978-3-319-07046-9_28"},{"key":"356_CR20","doi-asserted-by":"crossref","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 Processing Workshops and PhD Forum, pp. 1771\u20131777 (2013)","DOI":"10.1109\/IPDPSW.2013.210"},{"key":"356_CR21","doi-asserted-by":"crossref","unstructured":"Menouer, T., Cun, B.L.: 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":"356_CR22","doi-asserted-by":"crossref","unstructured":"Michel, L., See, A., Hentenryck, P.: Parallelizing constraint programs transparently. In: Bessi\u00e8re, C. (ed.) Principles and Practice of Constraint Programming (CP 2007), Volume 4204 of Lecture Notes in Computer Science, pp. 514\u2013528. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74970-7_37"},{"key":"356_CR23","doi-asserted-by":"crossref","unstructured":"Michel, L., See, A., Hentenryck, P.V.: Transparent Parallelization of Constraint Programs on Computer Clusters (2008)","DOI":"10.1007\/978-3-540-74970-7_37"},{"key":"356_CR24","doi-asserted-by":"crossref","unstructured":"Michel, L., See, A., Van Hentenryck, P.: Distributed constraint-based local search. In: Benhamou, F. (ed.) Principles and Practice of Constraint Programming (CP 2006), Volume 4204 of Lecture Notes in Computer Science, pp. 344\u2013358. Springer, Berlin (2006)","DOI":"10.1007\/11889205_26"},{"issue":"3","key":"356_CR25","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/ijoc.1080.0313","volume":"21","author":"L Michel","year":"2009","unstructured":"Michel, L., See, A., Van Hentenryck, P.: Transparent parallelization of constraint programming. Inf. J. Comput. 21(3), 363\u2013382 (2009)","journal-title":"Inf. J. Comput."},{"key":"356_CR26","unstructured":"Minizinc challenge http:\/\/www.minizinc.org\/challenge.html . Accessed 14 April 2014"},{"key":"356_CR27","unstructured":"Minizinc challenge http:\/\/www.minizinc.org\/challenge2012\/challenge.html . Accessed 14 April 2014 (2012)"},{"key":"356_CR28","unstructured":"NICTA: Specification of Zinc and Minizinc. Technical Report, Victoria Research Lab, Melbourne, Australia (2011)"},{"key":"356_CR29","unstructured":"Numberjack solver http:\/\/numberjack.ucc.ie\/ . Accessed 14 April 04 2014 (2013)"},{"key":"356_CR30","unstructured":"O\u2019mahony, E., Hebrard, E., Holland, A., Nugent, C.: Using case-based reasoning in an algorithm portfolio for constraint solving. In: Irish Conference on Artificial Intelligence and Cognitive Science (2008)"},{"key":"356_CR31","doi-asserted-by":"crossref","unstructured":"Pardalos, P.M.: Parallel Processing of Discrete Problems, Volume 106 of the IMA Volumes in Mathematics and Its Applications Edition. Springer, Berlin (1999)","DOI":"10.1007\/978-1-4612-1492-2"},{"key":"356_CR32","unstructured":"Pedro, V., Abreu, S.: Distributed work stealing for constraint solving. In: CoRR, abs\/1009.3800 (2010)"},{"key":"356_CR33","doi-asserted-by":"crossref","unstructured":"Perron, L.: Search procedures and parallelism in constraint programming. Princ. Pract. Constr. Program. (1999)","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"356_CR34","doi-asserted-by":"crossref","unstructured":"Pardalos, M.R.P.M., Ramakrishnan, K.: Parallel Processing of Discrete Optimization Problems. American Mathematical Society, Dimacs Series, vol. 22 edition (1995)","DOI":"10.1090\/dimacs\/022"},{"key":"356_CR35","doi-asserted-by":"crossref","unstructured":"R\u00e9gin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: 19th International Conference CP 2013 Uppsala Sweden (2013)","DOI":"10.1007\/978-3-642-40627-0_45"},{"key":"356_CR36","unstructured":"Rolf, C.C.: Parallelism in Constraint Programming. PhD thesis, Department of Computer Science, Lund University (2011)"},{"key":"356_CR37","unstructured":"Schulte, C.: Parallel search made simple. In: University of Singapore, pp. 41\u201357 (2000)"},{"key":"356_CR38","unstructured":"Schulte, C., Tack, G., Lagerkvist, M.Z.: Modeling and Programming with Gecode"},{"issue":"1","key":"356_CR39","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.parco.2010.08.004","volume":"37","author":"OV Shylo","year":"2011","unstructured":"Shylo, O.V., Middelkoop, T., Pardalos, P.M.: Restart strategies in optimization: parallel and serial cases. Parallel Comput. 37(1), 60\u201368 (2011)","journal-title":"Parallel Comput."},{"key":"356_CR40","volume-title":"Parallel Branch and Bound Algorithms, Chapter 1","author":"CR Theodor Crainic","year":"2006","unstructured":"Theodor Crainic, C.R., Le Cun, B.: Parallel Branch and Bound Algorithms, Chapter 1. Wiley, USA (2006)"},{"key":"356_CR41","unstructured":"van Omme, N., Perron, L., Furnon, V.: Or-Tools. Technical Report, Google (2012)"},{"key":"356_CR42","unstructured":"Vander-Swalmen, P., Dequen, G., Krajecki, M.: Designing a parallel collaborative sat solver. In: 17th International Conference on Parallel and Distributed Processing Techniques and Applications. CSREA Press, USA (2011)"},{"key":"356_CR43","unstructured":"Xie, F., Davenport, A.: Solving scheduling problems using parallel message-passing based constraint programming. In: Proceedings of the Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems COPLAS, pp. 53\u201358 (2009)"},{"key":"356_CR44","doi-asserted-by":"crossref","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 Trans. Knowl. Data Eng. 10, 673\u2013685 (1998)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"356_CR45","doi-asserted-by":"crossref","unstructured":"Yun, X., Epstein, S.L.: A hybrid paradigm for adaptive parallel search. In: CP, pp. 720\u2013734 (2012)","DOI":"10.1007\/978-3-642-33558-7_52"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-015-0356-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-015-0356-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-015-0356-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,3]],"date-time":"2022-05-03T05:02:15Z","timestamp":1651554135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-015-0356-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,18]]},"references-count":45,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["356"],"URL":"https:\/\/doi.org\/10.1007\/s10766-015-0356-7","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"value":"0885-7458","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,18]]}}}