{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:29:05Z","timestamp":1762324145797,"version":"3.37.3"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T00:00:00Z","timestamp":1503446400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2018,2]]},"DOI":"10.1007\/s10732-017-9354-9","type":"journal-article","created":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T15:20:20Z","timestamp":1503501620000},"page":"1-24","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Variations on memetic algorithms for graph coloring problems"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3749-3227","authenticated-orcid":false,"given":"Laurent","family":"Moalic","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Gondran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"issue":"4","key":"9354_CR1","first-page":"261","volume":"1","author":"K Aardal","year":"2003","unstructured":"Aardal, K., Hoesel, S., Koster, A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Q. J. Belg. Fr. Ital. Oper. Res. Soc. 1(4), 261\u2013317 (2003)","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"9354_CR2","unstructured":"Allignol, C., Barnier, N., Gondran, A.: Optimized flight level allocation at the continental scale. In: International Conference on Research in Air Transportation (ICRAT 2012), Berkeley, California, USA, 22\u201325 May 2012 (2012)"},{"issue":"1\u20134","key":"9354_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/B:ANOR.0000032574.01332.98","volume":"130","author":"N Barnier","year":"2004","unstructured":"Barnier, N., Brisset, P.: Graph coloring for air traffic flow management. Ann. Oper. Res. 130(1\u20134), 163\u2013178 (2004)","journal-title":"Ann. Oper. Res."},{"key":"9354_CR4","unstructured":"Dib, M., Caminada, A., Mabed, H.: Frequency management in radio military networks. In: INFORMS Telecom 2010, 10th INFORMS Telecommunications Conference Montreal, Canada (2010)"},{"issue":"10\u201311","key":"9354_CR5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0898-1221(93)90279-5","volume":"25","author":"N Dubois","year":"1993","unstructured":"Dubois, N., de Werra, D.: Epcot: an efficient procedure for coloring optimally with Tabu search. Comput. Math. Appl. 25(10\u201311), 35\u201345 (1993)","journal-title":"Comput. Math. Appl."},{"key":"9354_CR6","doi-asserted-by":"crossref","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. Ann. Oper. Res. 63, 437\u2013464 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"9354_CR7","doi-asserted-by":"crossref","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. 3(4), 379\u2013397 (1999)","journal-title":"J. Comb. Optim."},{"key":"9354_CR8","doi-asserted-by":"crossref","first-page":"2547","DOI":"10.1016\/j.cor.2005.07.028","volume":"33","author":"P Galinier","year":"2006","unstructured":"Galinier, P., Hertz, A.: A survey of local search methods for graph coloring. Comput. Oper. Res. 33, 2547\u20132562 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9354_CR9","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/j.dam.2006.07.017","volume":"156","author":"P Galinier","year":"2008","unstructured":"Galinier, P., Hertz, A., Zufferey, N.: An adaptive memory algorithm for the $$k$$ k -coloring problem. Discret. Appl. Math. 156(2), 267\u2013279 (2008)","journal-title":"Discret. Appl. Math."},{"key":"9354_CR10","doi-asserted-by":"crossref","unstructured":"Galinier, P., Hamiez, J.-P., Hao, J.-K., Porumbel, D.C.: Recent advances in graph vertex coloring. In: Zelinka, I., \u00a0Sn\u00e1sel, V., \u00a0Abraham, A. (eds) Handbook of Optimization, Vol.\u00a038 of Intelligent Systems Reference Library, pp. 505\u2013528. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-30504-7_20"},{"key":"9354_CR11","volume-title":"Computers and Intractability: A Guide to the Theory of $${\\cal{NP}}$$ NP","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $${\\cal{NP}}$$ NP -Completeness. Freeman, San Francisco (1979)"},{"issue":"3","key":"9354_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0020-0190(01)00263-0","volume":"82","author":"D Gusfield","year":"2002","unstructured":"Gusfield, D.: Partition-distance: a problem and class of perfect graphs arising in clustering. Inf. Process. Lett. 82(3), 159\u2013164 (2002)","journal-title":"Inf. Process. Lett."},{"key":"9354_CR13","doi-asserted-by":"crossref","unstructured":"Hao, J.-K.: Memetic algorithms in discrete optimization. In: Neri, F., \u00a0Cotta, C., \u00a0Moscato, P. (eds.) Handbook of Memetic Algorithms, Vol. 379 of Studies in Computational Intelligence, pp. 73\u201394. Springer, Berlin (2012)","DOI":"10.1007\/978-3-642-23247-3_6"},{"issue":"16\u201317","key":"9354_CR14","doi-asserted-by":"crossref","first-page":"2397","DOI":"10.1016\/j.dam.2012.06.007","volume":"160","author":"J-K Hao","year":"2012","unstructured":"Hao, J.-K., Wu, Q.: Improving the extraction and expansion method for large graph coloring. Discret. Appl. Math. 160(16\u201317), 2397\u20132407 (2012)","journal-title":"Discret. Appl. Math."},{"key":"9354_CR15","doi-asserted-by":"crossref","unstructured":"Held, S., Cook, W., Sewell, E.C.: Safe lower bounds for graph coloring. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) Integer Programming and Combinatoral Optimization. IPCO 2011. Lecture Notes in Computer Science, Vol. 6655. Springer, Berlin, Heidelberg (2011)","DOI":"10.1007\/978-3-642-20807-2_21"},{"issue":"4","key":"9354_CR16","doi-asserted-by":"crossref","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 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"13","key":"9354_CR17","doi-asserted-by":"crossref","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. Discret. Appl. Math. 156(13), 2551\u20132560 (2008)","journal-title":"Discret. Appl. Math."},{"key":"9354_CR18","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, Vol. 26 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence (1996)","DOI":"10.1090\/dimacs\/026"},{"issue":"3","key":"9354_CR19","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"DS Johnson","year":"1991","unstructured":"Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by Simulated annealing: an experimental evaluation. Part II, graph coloring and number partitioning. Oper. Res. 39(3), 378\u2013406 (1991)","journal-title":"Oper. Res."},{"key":"9354_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"issue":"6","key":"9354_CR21","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"FT Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. J. Res. Natl. Bur. Stand. 84(6), 489\u2013506 (1979)","journal-title":"J. Res. Natl. Bur. Stand."},{"key":"9354_CR22","doi-asserted-by":"crossref","unstructured":"Lewis, R.: Graph coloring and recombination. In: Kacprzyk, J., Pedrycz, W. (eds.) Handbook of Computational Intelligence, pp. 1239\u20131254. Springer, Berlin (2015). (Ch. Graph Coloring and Recombination)","DOI":"10.1007\/978-3-662-43505-2_63"},{"issue":"1","key":"9354_CR23","doi-asserted-by":"crossref","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. Eur. J. Oper. Res. 203(1), 241\u2013250 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9354_CR24","doi-asserted-by":"crossref","first-page":"1","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. Int. Trans. Oper. Res. 17(1), 1\u201334 (2010)","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9354_CR25","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/j.disopt.2010.07.005","volume":"8","author":"E Malaguti","year":"2011","unstructured":"Malaguti, E., Monaci, M., Toth, P.: An exact approach for the vertex coloring problem. Discret. Optim. 8(2), 174\u2013190 (2011)","journal-title":"Discret. Optim."},{"key":"9354_CR26","doi-asserted-by":"crossref","first-page":"1822","DOI":"10.1016\/j.cor.2010.01.015","volume":"37","author":"DC Porumbel","year":"2010","unstructured":"Porumbel, D.C., Hao, J.-K., Kuntz, P.: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring. Comput. Oper. Res. 37, 1822\u20131832 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9354_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/978-3-642-22000-5_57","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"O Titiloye","year":"2011","unstructured":"Titiloye, O., Crispin, A.: Graph coloring with a distributed hybrid quantum annealing algorithm. In: O\u2019Shea, J., Nguyen, N., Crockett, K., Howlett, R., Jain, L. (eds.) Agent and Multi-Agent Systems: Technologies and Applications. Lecture Notes in Computer Science, vol. 6682, pp. 553\u2013562. Springer, Berlin (2011a)"},{"issue":"2","key":"9354_CR28","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1016\/j.disopt.2010.12.001","volume":"8","author":"O Titiloye","year":"2011","unstructured":"Titiloye, O., Crispin, A.: Quantum annealing of the graph coloring problem. Discret. Optim. 8(2), 376\u2013384 (2011b)","journal-title":"Discret. Optim."},{"issue":"11","key":"9354_CR29","doi-asserted-by":"crossref","first-page":"e50060","DOI":"10.1371\/journal.pone.0050060","volume":"7","author":"O Titiloye","year":"2012","unstructured":"Titiloye, O., Crispin, A.: Parameter tuning patterns for random graph coloring with quantum annealing. PLoS ONE 7(11), e50060 (2012)","journal-title":"PLoS ONE"},{"key":"9354_CR30","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1093\/comjnl\/12.4.317","volume":"12","author":"DC Wood","year":"1969","unstructured":"Wood, D.C.: A technique for coloring a graph applicable to large-scale timetabling problems. Comput. J. 12, 317\u2013322 (1969)","journal-title":"Comput. J."},{"issue":"2","key":"9354_CR31","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.cor.2011.04.002","volume":"39","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J.-K.: Coloring large graphs based on independent set extraction. Comput. Oper. Res. 39(2), 283\u2013290 (2012)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9354_CR32","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s10951-008-0066-8","volume":"11","author":"N Zufferey","year":"2008","unstructured":"Zufferey, N., Amstutz, P., Giaccari, P.: Graph colouring approaches for a satellite range scheduling problem. J. Sched. 11(4), 263\u2013277 (2008)","journal-title":"J. Sched."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9354-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9354-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T14:35:26Z","timestamp":1570026926000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9354-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,23]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,2]]}},"alternative-id":["9354"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9354-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2017,8,23]]}}}