{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T11:39:32Z","timestamp":1743075572571,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319070452"},{"type":"electronic","value":"9783319070469"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07046-9_27","type":"book-chapter","created":{"date-parts":[[2014,5,12]],"date-time":"2014-05-12T02:07:28Z","timestamp":1399860448000},"page":"377-393","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Depth-Bounded Discrepancy Search"],"prefix":"10.1007","author":[{"given":"Thierry","family":"Moisan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Gaudreault","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"de la Banda, M.G., Stuckey, P.J., Van Hentenryck, P., Wallace, M.: The future of optimization technology. Constraints, 1\u201313 (2013)","DOI":"10.1007\/s10601-013-9149-z"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-642-40627-0_45","volume-title":"Principles and Practice of Constraint Programming","author":"J.-C. R\u00e9gin","year":"2013","unstructured":"R\u00e9gin, J.-C., Rezgui, M., Malapert, A.: Embarrassingly parallel search. In: Schulte, C. (ed.) CP 2013. LNCS, vol.\u00a08124, pp. 596\u2013610. Springer, Heidelberg (2013)"},{"key":"27_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-40627-0_6","volume-title":"Principles and Practice of Constraint Programming","author":"T. Moisan","year":"2013","unstructured":"Moisan, T., Gaudreault, J., Quimper, C.-G.: Parallel discrepancy-based search. In: Schulte, C. (ed.) CP 2013. LNCS, vol.\u00a08124, pp. 30\u201346. Springer, Heidelberg (2013)"},{"key":"27_CR4","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI 1995), pp. 607\u2013613 (1995)"},{"key":"27_CR5","unstructured":"Walsh, T.: Depth-bounded discrepancy search. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1388\u20131393 (1997)"},{"key":"27_CR6","doi-asserted-by":"crossref","unstructured":"Perron, L.: Search procedures and parallelism in constraint programming. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 346\u2013361. Springer, Heidelberg (1999)","DOI":"10.1007\/978-3-540-48085-3_25"},{"key":"27_CR7","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, SOCS 2010 (2010)","DOI":"10.1609\/socs.v1i1.18165"},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.parco.2010.08.004","volume":"37","author":"O.V. Shylo","year":"2010","unstructured":"Shylo, O.V., Middelkoop, T., Pardalos, P.M.: Restart strategies in optimization: Parallel and serial cases. Parallel Computing\u00a037(1), 60\u201368 (2010)","journal-title":"Parallel Computing"},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"245","DOI":"10.3233\/SAT190070","volume":"6","author":"Y. Hamadi","year":"2009","unstructured":"Hamadi, Y., 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":"27_CR10","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L. Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for sat. Journal of Artificial Intelligence Research (JAIR)\u00a032, 565\u2013606 (2008)","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"27_CR11","doi-asserted-by":"publisher","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. INFORMS Journal on Computing\u00a021, 363\u2013382 (2009)","journal-title":"INFORMS Journal on Computing"},{"key":"27_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/978-3-642-04244-7_20","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"G. Chu","year":"2009","unstructured":"Chu, G., Schulte, C., Stuckey, P.J.: Confidence-based work stealing in parallel constraint programming. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 226\u2013241. Springer, Heidelberg (2009)"},{"key":"27_CR13","series-title":"SCI","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-319-00293-4_10","volume-title":"Advanced Computational Methods for Knowledge Engineering","author":"T. Menouer","year":"2013","unstructured":"Menouer, T., Le Cun, B., Vander-Swalmen, P.: Partitioning methods to parallelize constraint programming solver using the parallel framework Bobpp. In: Nguyen, N.T., van Do, T., Thi, H.A. (eds.) ICCSAMA 2013. SCI, vol.\u00a0479, pp. 117\u2013127. Springer, Heidelberg (2013)"},{"key":"27_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-13520-0_36","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"F. Xie","year":"2010","unstructured":"Xie, F., Davenport, A.: Massively parallel constraint programming for supercomputers: Challenges and initial results. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 334\u2013338. Springer, Heidelberg (2010)"},{"key":"27_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1007\/978-3-642-33558-7_52","volume-title":"Principles and Practice of Constraint Programming","author":"X. Yun","year":"2012","unstructured":"Yun, X., Epstein, S.L.: A hybrid paradigm for adaptive parallel search. In: Milano, M. (ed.) CP 2012. LNCS, vol.\u00a07514, pp. 720\u2013734. Springer, Heidelberg (2012)"},{"key":"27_CR16","unstructured":"Korf, R.E.: Improved limited discrepancy search. In: Proceedings of the 30th National Conference on Artificial Intelligence and the 8th Innovative Applications of Artificial Intelligence Conference, vol.\u00a01, pp. 286\u2013291 (1996)"},{"key":"27_CR17","unstructured":"Beck, J.C., Perron, L.: Discrepancy-bounded depth first search. In: Proceedings of the Second International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR 2000), pp. 8\u201310 (2000)"},{"key":"27_CR18","unstructured":"Furcy, D., Koenig, S.: Limited discrepancy beam search. In: Proceedings of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 125\u2013131 (2005)"},{"key":"27_CR19","unstructured":"Gaudreault, J., Forget, P., Frayret, J.M., Rousseau, A., Lemieux, S., D\u2019Amours, S.: Distributed operations planning in the lumber supply chain: Models and coordination. International Journal of Industrial Engineering: Theory, Applications and Practice\u00a017 (2010)"},{"key":"27_CR20","doi-asserted-by":"publisher","first-page":"1238","DOI":"10.1016\/j.cor.2010.10.013","volume":"38","author":"J. Gaudreault","year":"2011","unstructured":"Gaudreault, J., Frayret, J.M., Rousseau, A., D\u2019Amours, S.: Combined planning and scheduling in a divergent production system with co-production: A case study in the lumber industry. Computers and Operations Research\u00a038, 1238\u20131250 (2011)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07046-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,13]],"date-time":"2023-07-13T01:29:17Z","timestamp":1689211757000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07046-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319070452","9783319070469"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07046-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}