{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:56Z","timestamp":1725795656251},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_8","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T21:27:11Z","timestamp":1401917231000},"page":"100-114","source":"Crossref","is-referenced-by-count":2,"title":["Cooperative Parallel Decomposition Guided VNS for Solving Weighted CSP"],"prefix":"10.1007","author":[{"given":"Abdelkader","family":"Ouali","sequence":"first","affiliation":[]},{"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[]},{"given":"Lakhdar","family":"Loukil","sequence":"additional","affiliation":[]},{"given":"Patrice","family":"Boizumault","sequence":"additional","affiliation":[]},{"given":"Yahia","family":"Lebbah","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1137\/0608024","volume":"8","author":"S. Arnborg","year":"1987","unstructured":"Arnborg, S., Corneil, D.G., Proskurowski, A.: Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1026488509554","volume":"4","author":"E. Bensana","year":"1999","unstructured":"Bensana, E., Lema\u00eetre, M., Verfaillie, G.: Earth observation satellite management. Constraints\u00a04(3), 293\u2013299 (1999)","journal-title":"Constraints"},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1023\/A:1009812409930","volume":"4","author":"B. Cabon","year":"1999","unstructured":"Cabon, B., de Givry, S., Lobjois, L., Schiex, T., Warners, J.P.: Radio link frequency assignment. Constraints\u00a04(1), 79\u201389 (1999)","journal-title":"Constraints"},{"issue":"3","key":"8_CR4","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 p-median. Journal of Heuristics\u00a010(3), 293\u2013314 (2004)","journal-title":"Journal of Heuristics"},{"key":"8_CR5","unstructured":"de Givry, S., Schiex, T., Verfaillie, G.: Exploiting tree decomposition and soft local consistency in weighted csp. In: AAAI, pp. 22\u201327. AAAI Press (2006)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R. Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. Artificial Intelligence\u00a038(3), 353\u2013366 (1989)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"8_CR7","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1086\/381000","volume":"74","author":"C.S. Carlson","year":"2004","unstructured":"Carlson, C.S., et al.: Selecting a maximally informative set of single-nucleotide polymorphisms for association analyses using linkage disequilibrium. American Journal of Human Genetics\u00a074(1), 106\u2013120 (2004)","journal-title":"American Journal of Human Genetics"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1051\/ro\/2013030","volume":"47","author":"M. Fontaine","year":"2013","unstructured":"Fontaine, M., Loudni, S., Boizumault, P.: Exploiting tree decomposition for guiding neighborhoods exploration for VNS. RAIRO Operations Research\u00a047(2), 91\u2013123 (2013)","journal-title":"RAIRO Operations Research"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Lee, S.T., Valiant, G.: Size and treewidth bounds for conjunctive queries. In: Paredaens, J., Su, J. (eds.) PODS, pp. 45\u201354. ACM (2009)","DOI":"10.1145\/1559795.1559804"},{"key":"8_CR10","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI, pp. 607\u2013615. Morgan Kaufmann (1995)"},{"key":"8_CR11","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: IJCAI, pp. 239\u2013244 (2003)"},{"key":"8_CR12","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1016\/j.ejor.2006.12.062","volume":"191","author":"S. Loudni","year":"2008","unstructured":"Loudni, S., Boizumault, P.: Combining VNS with constraint programming for solving anytime optimization problems. European Journal of Operational Research\u00a0191, 705\u2013735 (2008)","journal-title":"European Journal of Operational Research"},{"issue":"16-17","key":"8_CR13","doi-asserted-by":"publisher","first-page":"1457","DOI":"10.1016\/j.artint.2009.07.003","volume":"173","author":"R. Marinescu","year":"2009","unstructured":"Marinescu, R., Dechter, R.: AND\/OR branch-and-bound search for combinatorial optimization in graphical models. Artificial Intelligence\u00a0173(16-17), 1457\u20131491 (2009)","journal-title":"Artificial Intelligence"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers and Operations Research\u00a024, 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"},{"key":"8_CR15","unstructured":"Pearl, J.: Probabilistic inference in intelligent systems. In: Networks of Plausible Inference. Morgan Kaufmann (1998)"},{"issue":"1\/2","key":"8_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1006303512524","volume":"24","author":"I. Rish","year":"2000","unstructured":"Rish, I., Dechter, R.: Resolution versus search: Two strategies for SAT. Journal of Automated Reasoning\u00a024(1\/2), 225\u2013275 (2000)","journal-title":"Journal of Automated Reasoning"},{"issue":"3","key":"8_CR17","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N. Robertson","year":"1986","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. ii. algorithmic aspects of tree-width. Journal of Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"Journal of Algorithms"},{"key":"8_CR18","unstructured":"S\u00e1nchez, M., Allouche, D., de Givry, S., Schiex, T.: Russian doll search with tree decomposition. In: Boutilier, C. (ed.) IJCAI, pp. 603\u2013608 (2009)"},{"issue":"1-2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/s10601-007-9029-5","volume":"13","author":"M. S\u00e1nchez","year":"2008","unstructured":"S\u00e1nchez, M., de Givry, S., Schiex, T.: Mendelian error detection in complex pedigrees using weighted constraint satisfaction techniques. Constraints\u00a013(1-2), 130\u2013154 (2008)","journal-title":"Constraints"},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"R.E. Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing\u00a013(3), 566\u2013579 (1984)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:15:38Z","timestamp":1558916138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}