{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:27Z","timestamp":1775066007750,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319164670","type":"print"},{"value":"9783319164687","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-16468-7_15","type":"book-chapter","created":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T15:40:06Z","timestamp":1426347606000},"page":"173-183","source":"Crossref","is-referenced-by-count":11,"title":["The New Memetic Algorithm $$HEAD$$ for Graph Coloring: An Easy Way for Managing Diversity"],"prefix":"10.1007","author":[{"given":"Laurent","family":"Moalic","sequence":"first","affiliation":[]},{"given":"Alexandre","family":"Gondran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,15]]},"reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10288-003-0022-6","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). doi:\n                    10.1007\/s10288-003-0022-6","journal-title":"Q. J. Belg. Fr. Ital. Oper. Res. Soc."},{"key":"15_CR2","doi-asserted-by":"publisher","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":"4","key":"15_CR3","doi-asserted-by":"publisher","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."},{"issue":"1\u20134","key":"15_CR4","doi-asserted-by":"publisher","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). doi:\n                    10.1023\/B:ANOR.0000032574.01332.98","journal-title":"Ann. Oper. Res."},{"key":"15_CR5","doi-asserted-by":"publisher","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":"4","key":"15_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"6","key":"15_CR7","doi-asserted-by":"publisher","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. Stan. 84(6), 489\u2013506 (1979)","journal-title":"J. Res. Natl. Bur. Stan."},{"key":"15_CR8","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/dimacs\/026\/14","volume":"26","author":"F Glover","year":"1996","unstructured":"Glover, F., Parker, M., Ryan, J.: Coloring by tabu branch and bound. DIMACS Ser. Discrete Math. Theor. Comput. Sci. 26, 285\u2013307 (1996)","journal-title":"DIMACS Ser. Discrete Math. Theor. Comput. Sci."},{"issue":"66:2","key":"15_CR9","first-page":"163","volume":"24","author":"AA Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Mat. Sb. (N.S.) 24(66:2), 163\u2013188 (1949)","journal-title":"Mat. Sb. (N.S.)"},{"issue":"1","key":"15_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1287\/ijoc.1100.0436","volume":"24","author":"S Gualandi","year":"2012","unstructured":"Gualandi, S., Malucelli, F.: Exact solution of graph coloring problems via constraint programming and column generation. INFORMS J. Comput. 24(1), 81\u2013100 (2012). doi:\n                    10.1287\/ijoc.1100.0436","journal-title":"INFORMS J. Comput."},{"issue":"1","key":"15_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1013665718444","volume":"8","author":"M Caramia","year":"2002","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Constraint propagation in graph coloring. J. Heuristics 8(1), 83\u2013107 (2002)","journal-title":"J. Heuristics"},{"key":"15_CR12","unstructured":"Schindl, D.: Graph coloring and linear programming, presentation at First Joint Operations Research Days, Ecole Polytechnique F\u00e9d\u00e9rale de Lausanne (EPFL), available on line (last visited June 2005) (July 2003). \n                    http:\/\/roso.epfl.ch\/ibm\/jord03.html"},{"issue":"4","key":"15_CR13","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS J. Comput. 8(4), 344\u2013354 (1996)","journal-title":"INFORMS J. Comput."},{"issue":"7","key":"15_CR14","doi-asserted-by":"publisher","first-page":"2295","DOI":"10.1016\/j.cor.2008.09.004","volume":"36","author":"R Lewis","year":"2009","unstructured":"Lewis, R.: A general-purpose hill-climbing method for order independent minimum gr ouping problems: a case study in graph colouring and bin packing. Comput. Oper. Res. 36(7), 2295\u20132310 (2009). doi:\n                    10.1016\/j.cor.2008.09.004\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/B6VC5-4TGHNJ4-1\/2\/1040b5ca8ef6fc2ddf012f32f3de9cb5","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","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."},{"issue":"4","key":"15_CR16","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 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"2","key":"15_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. Eur. J. Oper. Res 151(2), 379\u2013388 (2003). Elsevier","journal-title":"Eur. J. Oper. Res"},{"issue":"13","key":"15_CR18","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. Discret. Appl. Math. 156(13), 2551\u20132560 (2008). doi:\n                    10.1016\/j.dam.2008.11.008","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"15_CR19","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/j.jda.2005.03.006","volume":"4","author":"M Caramia","year":"2006","unstructured":"Caramia, M., Dell\u2019Olmo, P., Italiano, G.F.: Checkcol: improved local search for graph coloringstar. J. Discret. Algorithms 4(2), 277\u2013298 (2006). doi:\n                    10.1016\/j.jda.2005.03.006","journal-title":"J. Discret. Algorithms"},{"key":"15_CR20","first-page":"72","volume-title":"Handbook of Genetic Algorithms","author":"J Mylopoulos","year":"1991","unstructured":"Mylopoulos, J., Reiter, R.: Order-based genetic algorithms and the graph coloring problem. In: Mylopoulos, J., Reiter, R. (eds.) Handbook of Genetic Algorithms, pp. 72\u201390. Van Nostrand Reinhold, New York (1991)"},{"key":"15_CR21","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. Ann. Oper. Res. 63, 437\u2013464 (1996)","journal-title":"Ann. Oper. Res."},{"issue":"5","key":"15_CR22","doi-asserted-by":"publisher","first-page":"819","DOI":"10.1057\/jors.2009.27","volume":"61","author":"M Plumettaz","year":"2010","unstructured":"Plumettaz, M., Schindl, D., Zufferey, N.: Ant local search and its efficient adaptation to graph colouring. J. Oper. Res. Soc. 61(5), 819\u2013826 (2010). doi:\n                    10.1057\/jors.2009.27","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"15_CR23","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. 3(4), 379\u2013397 (1999). doi:\n                    10.1023\/A:1009823419804","journal-title":"J. Comb. Optim."},{"issue":"1","key":"15_CR24","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. Eur. J. Oper. Res. 203(1), 241\u2013250 (2010). doi:\n                    10.1016\/j.ejor.2009.07.016","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"15_CR25","doi-asserted-by":"publisher","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). doi:\n                    10.1016\/j.cor.2011.04.002","journal-title":"Comput. Oper. Res."},{"key":"15_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-22000-5_57","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"Olawale Titiloye","year":"2011","unstructured":"Titiloye, Olawale, Crispin, Alan: Graph coloring with a distributed hybrid quantum annealing algorithm. In: O\u2019Shea, James, Nguyen, Ngoc Thanh, Crockett, Keeley, Howlett, Robert J., Jain, Lakhmi C. (eds.) KES-AMSTA 2011. LNCS, vol. 6682, pp. 553\u2013562. Springer, Heidelberg (2011)"},{"issue":"2","key":"15_CR27","doi-asserted-by":"publisher","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 (2011). doi:\n                    10.1016\/j.disopt.2010.12.001","journal-title":"Discret. Optim."},{"issue":"11","key":"15_CR28","doi-asserted-by":"publisher","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). doi:\n                    10.1371\/journal.pone.0050060","journal-title":"PLoS ONE"},{"key":"15_CR29","unstructured":"Moalic, L., Gondran, A.: Variations on Memetic Algorithms for Graph Coloring Problems. \n                    http:\/\/arxiv.org\/abs\/arXiv1401.2184"},{"key":"15_CR30","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993","year":"1996","unstructured":"Johnson, D.S., Trick, M. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society, Providence (1996)"},{"issue":"2","key":"15_CR31","doi-asserted-by":"publisher","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 \n                    \n                      \n                    \n                    $$k$$\n                  -coloring problem. Discret. Appl. Math. 156(2), 267\u2013279 (2008). doi:\n                    10.1016\/j.dam.2006.07.017","journal-title":"Discret. Appl. Math."}],"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-319-16468-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T15:49:07Z","timestamp":1559144947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-16468-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319164670","9783319164687"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-16468-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]}}}