{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:31:46Z","timestamp":1762101106905},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540232414"},{"type":"electronic","value":"9783540302018"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30201-8_32","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T17:14:37Z","timestamp":1285175677000},"page":"423-437","source":"Crossref","is-referenced-by-count":27,"title":["ID Walk: A Candidate List Strategy with a Simple Diversification Device"],"prefix":"10.1007","author":[{"given":"Bertrand","family":"Neveu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gilles","family":"Trombettoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","unstructured":"Bessi\u00e8re, C.: Random Uniform CSP Generators, http:\/\/www.lirmm.fr\/bessiere\/generator.html"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","volume":"46","author":"D.T. Connolly","year":"1990","unstructured":"Connolly, D.T.: An improved annealing scheme for the qap. European Journal of Operational Research\u00a046, 93\u2013100 (1990)","journal-title":"European Journal of Operational Research"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0017456","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"S. Givry de","year":"1997","unstructured":"de Givry, S., Verfaillie, G., Schiex, T.: Bounding the optimum of constraint optimization problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, Springer, Heidelberg (1997)"},{"key":"32_CR4","first-page":"77","volume-title":"Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.K.: Tabu search for graph coloring, T-colorings and set Tcolorings. In: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 77\u201392. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"32_CR5","unstructured":"Eisenbl\u00e4tter, A., Koster, A.: FAP web - A website about Frequency Assignment Problems, http:\/\/fap.zib.de\/"},{"issue":"4","key":"32_CR6","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization\u00a03(4), 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"key":"32_CR7","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. Gent","year":"1999","unstructured":"Gent, I., Walsh, T.: CSPLib: a benchmark library for constraints. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 480\u2013481. Springer, Heidelberg (1999)"},{"key":"32_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"32_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-540-24664-0_28","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Gomes","year":"2004","unstructured":"Gomes, C., Sellmann, M., van Es, C., van Es, H.: The challenge of generating spatially balanced scientific experiment designs. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 387\u2013394. Springer, Heidelberg (2004)"},{"key":"32_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36605-9_23","volume-title":"Applications of Evolutionary Computing","author":"J. Gottlieb","year":"2003","unstructured":"Gottlieb, J., Puchta, M., Solnon, C.: A study of greedy, local search and ant colony optimization approaches for car sequencing problems. In: Raidl, G.R., Cagnoni, S., Cardalda, J.J.R., Corne, D.W., Gottlieb, J., Guillot, A., Hart, E., Johnson, C.G., Marchiori, E., Meyer, J.-A., Middendorf, M. (eds.) EvoIASP 2003, EvoWorkshops 2003, EvoSTIM 2003, EvoROB\/EvoRobot 2003, EvoCOP 2003, EvoBIO 2003, and EvoMUSART 2003. LNCS, vol.\u00a02611, pp. 246\u2013257. Springer, Heidelberg (2003)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gellat, C., Vecchi, M.: Optimization by simulated annealing. Science\u00a0220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"32_CR12","unstructured":"Kolen, A.: A genetic algorithm for frequency assignment. Technical report, Universiteit Maastricht (1999)"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Koster, A., Van Hoesel, C., Kolen, A.: Solving frequency assignment problems via tree-decomposition. Technical Report 99-011, Universiteit Maastricht (1999)","DOI":"10.1007\/3-540-46784-X_32"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: Proc. of the OOPSLA conference (2002)","DOI":"10.1145\/582419.582430"},{"key":"32_CR15","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., Philips, A., Laird, P.: Minimizing conflict: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence\u00a058, 161\u2013205 (1992)","journal-title":"Artificial Intelligence"},{"key":"32_CR16","first-page":"335","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"C. Morgenstern","year":"1993","unstructured":"Morgenstern, C.: Distributed coloration neighborhood search. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, vol.\u00a026, pp. 335\u2013357. American Mathematical Society, Providence (1993)"},{"key":"32_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"909","DOI":"10.1007\/978-3-540-45193-8_77","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"B. Neveu","year":"2003","unstructured":"Neveu, B., Trombettoni, G.: INCOP: An Open Library for INcomplete Combinatorial OPtimization. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 909\u2013913. Springer, Heidelberg (2003)"},{"key":"32_CR18","unstructured":"Neveu, B., Trombettoni, G.: When Local Search Goes with the Winners. In: Int. Workshop CPAIOR 2003, pp. 180\u2013194 (2003)"},{"key":"32_CR19","unstructured":"Selman, B., Kautz, H., Cohen, B.: Local search strategies for satisfiability testing. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge. Theoretical Computer Science, vol. 26, AMS (2003)"},{"key":"32_CR20","unstructured":"Voudouris, C., Tsang, E.: Solving the radio link frequency assignment problem using guided local search. In: Nato Symposium on Frequency Assignment, Sharing and Conservation in Systems (AEROSPACE) (1998)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30201-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:47:46Z","timestamp":1605743266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30201-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540232414","9783540302018"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30201-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}