{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:10:08Z","timestamp":1760645408735},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540434320"},{"type":"electronic","value":"9783540460046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_13","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T21:43:59Z","timestamp":1183412639000},"page":"122-131","source":"Crossref","is-referenced-by-count":18,"title":["An Experimental Investigation of Iterated Local Search for Coloring Graphs"],"prefix":"10.1007","author":[{"given":"Luis","family":"Paquete","sequence":"first","affiliation":[]},{"given":"Thomas","family":"St\u00fctzle","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1287\/opre.34.2.193","volume":"34","author":"M.W. Carter","year":"1986","unstructured":"M.W. Carter. A survey of pratical applications of examination timetabling algorithms. Operations Research, 34(2):193\u2013202, 1986.","journal-title":"Operations Research"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF02125459","volume":"63","author":"D.J. Castelino","year":"1996","unstructured":"D.J. Castelino, S. Hurley, and N.M. Stephens. A tabu search algorithm for frequency assignment. Annals of Operations Research, 63:301\u2013320, 1996.","journal-title":"Annals of Operations Research"},{"key":"13_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA, USA, 1979."},{"issue":"4","key":"13_CR4","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"A. Mehrotra and M. Trick. A column generation approach for graph coloring. INFORMS Journal On Computing, 8(4):344\u2013354, 1996.","journal-title":"INFORMS Journal On Computing"},{"issue":"4","key":"13_CR5","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz. New methods to color the vertices of a graph. Communications of the ACM, 22(4):251\u2013256, 1979.","journal-title":"Communications of the ACM"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"C. Fleurent and J. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, 63:437\u2013464, 1996.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"13_CR7","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"P. Galinier and J.K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 3(4):379\u2013397, 1999.","journal-title":"Journal of Combinatorial Optimization"},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39:345\u2013351, 1987.","journal-title":"Computing"},{"issue":"3","key":"13_CR9","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. Johnson","year":"1991","unstructured":"D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation: Part II, graph coloring and number partitioning. Operations Research, 39(3):378\u2013406, 1991.","journal-title":"Operations Research"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"85","author":"F.T. Leighton","year":"1979","unstructured":"F.T. Leighton. Agraph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 85:489\u2013506, 1979.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"13_CR11","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2002","unstructured":"H.R. Louren\u00e7o, O. Martin, and T. St\u00fctzle. Iterated local search. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics. Kluwer Academic Publishers, Boston, MA, USA, 2002. to appear."},{"key":"13_CR12","unstructured":"J.C. Culberson. Iterated greedy graph coloring and the difficulty landscape. Technical Report 92\u201307, Department of Computing Science, The University of Alberta, Edmonton, Alberta, Canada, June 1992."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"52","author":"S. Minton","year":"1992","unstructured":"S. Minton, M.D. Johnston, A.B. Philips, and P. Laird. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 52:161\u2013205, 1992.","journal-title":"Artificial Intelligence"},{"key":"13_CR14","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4615-5775-3_6","volume-title":"Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization","author":"R. Dorne","year":"1999","unstructured":"R. Dorne and J.K. Hao. Tabu search for graph coloring, t-colorings and set t-colorings. In I.H. Osman S. Voss, S. Martello and C. Roucairol, editors, Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization, pages 77\u201392. Kluwer Academic Publishers, Boston, MA, USA, 1999."},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M. Chams","year":"1987","unstructured":"M. Chams, A. Hertz, and D. De Werra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research, 32:260\u2013266, 1987.","journal-title":"European Journal of Operational Research"},{"key":"13_CR16","first-page":"72","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"L. Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of Genetic Algorithms, pages 72\u201390. Van Nostrand Reinhold; New York, 1991."},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1009638304510","volume":"4","author":"A.E. Eiben","year":"1998","unstructured":"A.E. Eiben, J.K. Hauw, and J.I. Van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4:25\u201346, 1998.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"13_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1011237503342","volume":"19","author":"M. Laguna","year":"2001","unstructured":"M. Laguna and R. Mart\u00ed. A GRASP for coloring sparse graphs. Computational Optimization and Applications, 19(2):165\u2013178, 2001.","journal-title":"Computational Optimization and Applications"},{"key":"13_CR19","doi-asserted-by":"crossref","unstructured":"C. Fleurent and J. Ferland. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique and satisfiability. In D.S. Johnson and M.A. Trick, editors, Cliques, Coloring, and Satisfiability: SecondDIMACS Implementation Challenge, volume 26, pages 619\u2013652. American Mathematical Society, 1996.","DOI":"10.1090\/dimacs\/026\/29"},{"key":"13_CR20","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"D.S. Johnson and L.A. McGeoch. The travelling salesman problem: A case study in local optimization. In E.H.L. Aarts and J.K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 215\u2013310. John Wiley & Sons, Chichester, UK, 1997."},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1002\/cpe.4330070404","volume":"7","author":"O. Martin","year":"1995","unstructured":"O. Martin and S.W. Otto. Partitoning of unstructured meshes for load balancing. Concurrency: Practice and Experience, 7:303\u2013314, 1995.","journal-title":"Concurrency: Practice and Experience"},{"key":"13_CR22","unstructured":"H.H. Hoos and T. St\u00fctzle. Evaluating Las Vegas algorithms-pitfalls and remedies. In Proceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence (UAI-98), pages 238\u2013245. Morgan Kaufmann, San Francisco, 1998."},{"key":"13_CR23","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0004-3702(99)00048-X","volume":"112","author":"H.H. Hoos","year":"1999","unstructured":"H.H. Hoos and T. St\u00fctzle. Characterising the behaviour of stochastic local search. Artificial Intelligence, 112:213\u2013232, 1999.","journal-title":"Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:55:32Z","timestamp":1550404532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}