{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T19:58:56Z","timestamp":1760644736203,"version":"3.41.0"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,9,1]],"date-time":"2003-09-01T00:00:00Z","timestamp":1062374400000},"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":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,9]]},"DOI":"10.1023\/a:1027312403532","type":"journal-article","created":{"date-parts":[[2003,11,9]],"date-time":"2003-11-09T22:46:39Z","timestamp":1068417999000},"page":"229-236","source":"Crossref","is-referenced-by-count":30,"title":["Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm"],"prefix":"10.1007","volume":"7","author":[{"given":"Celia A.","family":"Glass","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Pr\u00fcgel-Bennett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"5149229_CR1","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1145\/355873.355883","volume":"6","author":"G. Carpaneto","year":"1980","unstructured":"G. Carpaneto and P. Toth, \u201cAlgorithm 548: Solution of the assignment problem,\u201d ACM Transactions of Mathematical Software, vol. 6, no. 1, pp. 104-111, 1980.","journal-title":"ACM Transactions of Mathematical Software"},{"key":"5149229_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02430368","volume":"1","author":"D. Costa","year":"1995","unstructured":"D. Costa, A. Hertz, and O. Dubuis, \u201cEmbedding a sequential procedure within an evolutionary algorithm for coloring problems,\u201d Journal of Heuristics, vol. 1, pp. 105-128, 1995.","journal-title":"Journal of Heuristics"},{"issue":"3","key":"5149229_CR3","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. David","year":"1991","unstructured":"D.S. David, S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon, \u201cOptimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning,\u201d Operations Research, vol. 39, no. 3, pp. 378-406, 1991.","journal-title":"Operations Research"},{"key":"5149229_CR4","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991."},{"key":"5149229_CR5","unstructured":"A. Eisenbl\u00e4tter and A. Koster, \u201cFAP web-a website about frequency assignment problems,\u201d 2000. Available on the world wide web at http:\/\/fap.zib.de\/"},{"key":"5149229_CR6","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"C. Fleurent and J.A. Ferland, \u201cGenetic and hybrid algorithms for graph coloring,\u201d Annals of Operations Research, vol. 63, pp. 437-461, 1996.","journal-title":"Annals of Operations Research"},{"issue":"4","key":"5149229_CR7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P. Galinier","year":"1999","unstructured":"P. Galinier and J.K. Hao, \u201cHybrid evolutionary algorithms for graph coloring,\u201d Journal of Combinatorial Optimization, vol. 3, no. 4, pp. 379-397, 1999.","journal-title":"Journal of Combinatorial Optimization"},{"key":"5149229_CR8","unstructured":"C.A. Glass and A. Pr\u00fcgel-Bennett, \u201cA polynomially searchable exponential neighbourhood for graph coloring,\u201d 1998. Available on the world wide web at http:\/\/www.bib.ecs.soton.ac.uk\/cgi-bin\/record\/6935."},{"key":"5149229_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"A. Hertz and D. De Werra, \u201cUsing tabu search techniques for graph coloring,\u201d Computing, vol. 39, pp. 345-351, 1987.","journal-title":"Computing"},{"key":"5149229_CR10","unstructured":"D.S. Johnson and M.A. Trick (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, 1996. Available via ftp from ftp:\/\/dimacs.rutgers.edu\/ pub\/challenge\/graph\/benchmarks\/."},{"key":"5149229_CR11","doi-asserted-by":"crossref","unstructured":"C. Morgenstern, \u201cDistributed coloration neighborhood search,\u201d in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society, vol. 26, pp. 335-357, 1996.","DOI":"10.1090\/dimacs\/026\/16"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027312403532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1027312403532\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1027312403532.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:42:52Z","timestamp":1751283772000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1027312403532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,9]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,9]]}},"alternative-id":["5149229"],"URL":"https:\/\/doi.org\/10.1023\/a:1027312403532","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,9]]}}}