{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T01:01:53Z","timestamp":1725670913586},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642291234"},{"type":"electronic","value":"9783642291241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_14","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T17:24:42Z","timestamp":1332523482000},"page":"160-171","source":"Crossref","is-referenced-by-count":0,"title":["Intensification\/Diversification-Driven ILS for a Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Samir","family":"Loudni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"14_CR1","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10479-010-0716-z","volume":"179","author":"E.K. Burke","year":"2010","unstructured":"Burke, E.K., Marecek, J., Parkes, A.J., Rudov\u00e1, H.: A supernodal formulation of vertex colouring with applications in course timetabling. Annals OR\u00a0179(1), 105\u2013130 (2010)","journal-title":"Annals OR"},{"issue":"8","key":"14_CR2","doi-asserted-by":"publisher","first-page":"2384","DOI":"10.1016\/j.cor.2005.09.010","volume":"34","author":"M. Gamache","year":"2007","unstructured":"Gamache, M., Hertz, A., Ouellet, J.O.: A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding. Computers & OR\u00a034(8), 2384\u20132395 (2007)","journal-title":"Computers & OR"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1111\/j.1475-3995.2009.00696.x","volume":"17","author":"E. Malaguti","year":"2010","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. Intl. Trans. in Op. Res.\u00a017(1), 1475\u20133995 (2010)","journal-title":"Intl. Trans. in Op. Res."},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Bl\u00f6chliger","year":"2008","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A graph coloring heuristic using partial solutions and a reactive tabu scheme. Computers & OR\u00a035(3), 960\u2013975 (2008)","journal-title":"Computers & OR"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., de Werra, D.: Using tabu search techniques for graph coloring. Computing\u00a039(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"13","key":"14_CR6","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1016\/j.dam.2008.03.022","volume":"156","author":"A. Hertz","year":"2008","unstructured":"Hertz, A., Plumettaz, M., Zufferey, N.: Variable space search for graph coloring. Discrete Applied Mathematics\u00a0156(13), 2551\u20132560 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"14_CR7","series-title":"DIMACS Series","first-page":"335","volume-title":"Distributed coloration neighborhood search","author":"C. Morgenstern","year":"1996","unstructured":"Morgenstern, C.: Distributed coloration neighborhood search. DIMACS Series, vol.\u00a026, pp. 335\u2013357. Providence, RI (1996)"},{"issue":"3","key":"14_CR8","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.: Genetic and hybrid algorithms for graph coloring. Annals of Operations Research\u00a063(3), 437\u2013461 (1996)","journal-title":"Annals of Operations Research"},{"issue":"4","key":"14_CR9","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. J. Comb. Optim.\u00a03(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: A memetic algorithm for graph coloring. European Journal of Operational Research\u00a0203(1), 241\u2013250 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"14_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1287\/ijoc.1070.0245","volume":"20","author":"E. Malaguti","year":"2008","unstructured":"Malaguti, E., Monaci, M., Toth, P.: A metaheuristic approach for the vertex coloring problem. INFORMS Journal on Computing\u00a020(2), 302\u2013316 (2008)","journal-title":"INFORMS Journal on Computing"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search: Framework and applications. In: Handbook of Metaheuristics, vol.\u00a0146, pp. 363\u2013397. Springer, New York (2010)"},{"issue":"3","key":"14_CR13","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.: Search intensity versus search diversity: a false trade off? Appl. Intell.\u00a032(3), 279\u2013291 (2010)","journal-title":"Appl. Intell."},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"14_CR15","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)"},{"key":"14_CR16","unstructured":"Trick, M.: Computational symposium: Graph coloring and its generalizations. Cornell University, Ithaca, NY (2002), \n                  \n                    http:\/\/mat.gsia.cmu.edu\/COLOR02\/"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/S0377-2217(02)00832-9","volume":"151","author":"C. Avanthay","year":"2003","unstructured":"Avanthay, C., Hertz, A., Zufferey, N.: A variable neighborhood search for graph coloring. European Journal of Operational Research\u00a0151(2), 379\u2013388 (2003)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"14_CR18","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.engappai.2010.01.014","volume":"23","author":"S. Loudni","year":"2010","unstructured":"Loudni, S., Boizumault, P., Levasseur, N.: Advanced generic neighborhood heuristics for vns. Eng. Appl. of AI\u00a023(5), 736\u2013764 (2010)","journal-title":"Eng. Appl. of AI"},{"key":"14_CR19","unstructured":"Chiarandini, M., St\u00fctzle, T.: An application of iterated local search to graph coloring. In: Proceedings of the Comput. Symposium on Graph Coloring and its Generalizations, Ithaca, New York, USA, pp. 112\u2013125 (2002)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:24:57Z","timestamp":1620127497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}