{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:03:06Z","timestamp":1725890586395},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385155"},{"type":"electronic","value":"9783642385162"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38516-2_3","type":"book-chapter","created":{"date-parts":[[2013,5,15]],"date-time":"2013-05-15T23:10:01Z","timestamp":1368659401000},"page":"22-36","source":"Crossref","is-referenced-by-count":3,"title":["Intensification\/Diversification in Decomposition Guided VNS"],"prefix":"10.1007","author":[{"given":"Samir","family":"Loudni","sequence":"first","affiliation":[]},{"given":"Mathieu","family":"Fontaine","sequence":"additional","affiliation":[]},{"given":"Patrice","family":"Boizumault","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"http:\/\/www-sop.inria.fr\/coprin\/neveu\/incop\/presentation-incop.html"},{"key":"3_CR2","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. J. on Algebraic and Discrete Methods\u00a08, 277\u2013284 (1987)","journal-title":"SIAM. J. on Algebraic and Discrete Methods"},{"issue":"3","key":"3_CR3","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":"3_CR4","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"},{"key":"3_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":"3_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. Artif. Intell.\u00a038(3), 353\u2013366 (1989)","journal-title":"Artif. Intell."},{"issue":"1","key":"3_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. Am. J. of Hum. Genetics\u00a074(1), 106\u2013120 (2004)","journal-title":"Am. J. of Hum. Genetics"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Fontaine, M., Loudni, S., Boizumault, P.: Guiding VNS with tree decomposition. In: ICTAI, pp. 505\u2013512. IEEE (2011)","DOI":"10.1109\/ICTAI.2011.82"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Lee, S.T., Valiant, G.: Size and treewidth bounds for conjunctive queries. In: PODS, pp. 45\u201354 (2009)","DOI":"10.1145\/1559795.1559804"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Mikl\u00f3s, Z., Schwentick, T.: Generalized hypertree decompositions: Np-hardness and tractable variants. J. ACM\u00a056(6) (2009)","DOI":"10.1145\/1568318.1568320"},{"issue":"4","key":"3_CR11","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N., Perez-Brito, D.: Variable neighborhood decomposition search. Journal of Heuristics\u00a07(4), 335\u2013350 (2001)","journal-title":"Journal of Heuristics"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Harvey, W.D., Ginsberg, M.L.: Limited discrepancy search. In: IJCAI (1), pp. 607\u2013615. Morgan Kaufmann (1995)","DOI":"10.1016\/0003-4975(95)00537-U"},{"key":"3_CR13","first-page":"54","volume":"8","author":"A.M.C.A. Koster","year":"2001","unstructured":"Koster, A.M.C.A., Bodlaender, H.L., van Hoesel, S.P.M.: Treewidth: Computational experiments. ENDM\u00a08, 54\u201357 (2001)","journal-title":"ENDM"},{"key":"3_CR14","unstructured":"Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: IJCAI, pp. 239\u2013244 (2003)"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/s10489-008-0145-8","volume":"32","author":"A. Linhares","year":"2010","unstructured":"Linhares, A., Yanasse, H.H.: Search intensity versus search diversity: a false trade off? Appl. Intell.\u00a032(3), 279\u2013291 (2010)","journal-title":"Appl. Intell."},{"key":"3_CR16","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. EJOR\u00a0191, 705\u2013735 (2008)","journal-title":"EJOR"},{"issue":"16-17","key":"3_CR17","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. Artif. Intell.\u00a0173(16-17), 1457\u20131491 (2009)","journal-title":"Artif. Intell."},{"key":"3_CR18","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":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-540-30201-8_32","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"B. Neveu","year":"2004","unstructured":"Neveu, B., Trombettoni, G., Glover, F.: ID Walk: A candidate list strategy with a simple diversification device. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 423\u2013437. Springer, Heidelberg (2004)"},{"issue":"1\/2","key":"3_CR20","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. J. Autom. Reasoning\u00a024(1\/2), 225\u2013275 (2000)","journal-title":"J. Autom. Reasoning"},{"issue":"3","key":"3_CR21","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. J. Algorithms\u00a07(3), 309\u2013322 (1986)","journal-title":"J. Algorithms"},{"key":"3_CR22","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)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and Practice of Constraint Programming - CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P.: Using constraint programming and local search methods to solve vehicle routing problems. In: Maher, M.J., Puget, J.-F. (eds.) CP 1998. LNCS, vol.\u00a01520, pp. 417\u2013431. Springer, Heidelberg (1998)"},{"issue":"3","key":"3_CR24","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 J. Comput.\u00a013(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"3_CR25","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(02)00400-9","volume":"146","author":"C. Terrioux","year":"2003","unstructured":"Terrioux, C., J\u00e9gou, P.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence\u00a0146(1), 43\u201375 (2003)","journal-title":"Artificial Intelligence"},{"key":"3_CR26","unstructured":"van Benthem, H.: GRAPH: Generating radiolink frequency assignment problems heuristically (1995)"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38516-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T20:47:11Z","timestamp":1674852431000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-38516-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385155","9783642385162"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38516-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}
