{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:33:31Z","timestamp":1761896011105},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,3,14]],"date-time":"2015-03-14T00:00:00Z","timestamp":1426291200000},"content-version":"tdm","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":[[2015,8]]},"DOI":"10.1007\/s10732-015-9288-z","type":"journal-article","created":{"date-parts":[[2015,3,13]],"date-time":"2015-03-13T14:51:47Z","timestamp":1426258307000},"page":"501-521","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Hybrid evolutionary algorithm for the b-chromatic number"],"prefix":"10.1007","volume":"21","author":[{"given":"Iztok","family":"Fister","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iztok","family":"Peterin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marjan","family":"Mernik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matej","family":"\u010crepin\u0161ek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,3,14]]},"reference":[{"key":"9288_CR1","doi-asserted-by":"crossref","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, 379\u2013388 (2003)","journal-title":"Eur. J. Oper. Res."},{"key":"9288_CR2","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195099713.001.0001","volume-title":"Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms","author":"T B\u00e4ck","year":"1996","unstructured":"B\u00e4ck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, Oxford (1996)"},{"key":"9288_CR3","doi-asserted-by":"crossref","first-page":"1173","DOI":"10.1016\/j.dam.2011.08.022","volume":"161","author":"R Balakrishnan","year":"2013","unstructured":"Balakrishnan, R., Raj, S.F.: Bounds for the b-chromatic number of $$G-v$$ G - v . Discret. Appl. Math. 161, 1173\u20131179 (2013)","journal-title":"Discret. Appl. Math."},{"key":"9288_CR4","unstructured":"Balakrishnan, R., Raj, S.F., Kavaskar, T.: Coloring the Mycielskian. Proc. Int. Conf. ICDM 1401, 53\u201357 (2008)"},{"key":"9288_CR5","doi-asserted-by":"crossref","first-page":"1761","DOI":"10.1016\/j.dam.2007.04.011","volume":"155","author":"D Barth","year":"2007","unstructured":"Barth, D., Cohen, J., Faik, T.: On the b-continuity property of graphs. Discret. Appl. Math. 155, 1761\u20131768 (2007)","journal-title":"Discret. Appl. Math."},{"key":"9288_CR6","unstructured":"Bl\u00f6chliger, I., Zufferey, N.: A reactive Tabu search using partial solutions for the graph coloring problem. In: Kral, D., Sgall, J. (eds.), Coloring Graphs from Lists with Bounded Size of their Union: Result from Dagstuhl Seminar, vol. 03391 (2003)"},{"issue":"3","key":"9288_CR7","doi-asserted-by":"crossref","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. Comput. Oper. Res. 35(3), 960\u2013975 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"9288_CR8","doi-asserted-by":"crossref","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.A., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"9288_CR9","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","volume":"35","author":"C Blum","year":"2003","unstructured":"Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Comput. Surv. 35(3), 268\u2013308 (2003)","journal-title":"ACM Comput. Surv."},{"key":"9288_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)"},{"issue":"4","key":"9288_CR11","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Brelaz","year":"1979","unstructured":"Brelaz, D.: New methods to color vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"6","key":"9288_CR12","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1109\/TEVC.2006.872133","volume":"10","author":"J Brest","year":"2006","unstructured":"Brest, J., Greiner, S., Bo\u0161kovi\u0107, B., Mernik, M., \u017dumer, V.: Self-adapting control parameters in differential evolution: a comparative study on numerical benchmark problems. IEEE Trans. Evol. Comput. 10(6), 646\u2013657 (2006)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"4","key":"9288_CR13","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/mnsc.19.4.456","volume":"19","author":"R Brown","year":"1972","unstructured":"Brown, R., Roli, A.: Chromatic scheduling and the chromatic number problem. Manag. Sci. 19(4), 456\u2013463 (1972)","journal-title":"Manag. Sci."},{"key":"9288_CR14","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1016\/j.dam.2011.04.028","volume":"159","author":"S Cabello","year":"2011","unstructured":"Cabello, S., Jakovac, M.: On the b-chromatic number of regular graphs. Discret. Appl. Math. 159, 1303\u20131310 (2011)","journal-title":"Discret. Appl. Math."},{"key":"9288_CR15","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/S0377-2217(87)80148-0","volume":"32","author":"M Chams","year":"1987","unstructured":"Chams, M., Hertz, A., de Werra, D.: Some experiments with simulated annealing for coloring graphs. Eur. J. Oper. Res. 32, 260\u2013266 (1987)","journal-title":"Eur. J. Oper. Res."},{"key":"9288_CR16","first-page":"375","volume":"26","author":"F Chaouche","year":"2007","unstructured":"Chaouche, F., Berrachedi, A.: Some bounds for the b-chromatic number of a generalized Hamming graphs. Far East J. Appl. Math. 26, 375\u2013391 (2007)","journal-title":"Far East J. Appl. Math."},{"key":"9288_CR17","doi-asserted-by":"crossref","unstructured":"Chiarandini, M., Dumitrescu, I., St\u00fctzle, T.: Stochastic local search algorithms for the graph colouring problem, In: Gonzalez, T.F. (Ed.), Handbook of Approximation Algorithms and Metaheuristics, pp. 63.1\u201363.17. Chapman Hall, Boca Raton (2007)","DOI":"10.1201\/9781420010749.ch63"},{"key":"9288_CR18","unstructured":"Chiarandini, M., St\u00fctzle, T.: An application of iterated local search to graph coloring. In: Johnson, D.S., Mehrotra, A., Trick, M. (eds.) Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 112\u2013125 (2002)"},{"key":"9288_CR19","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.dam.2004.09.006","volume":"146","author":"S Corteel","year":"2005","unstructured":"Corteel, S., Valencia-Pabon, M., Vera, J.-C.: On approximating the b-chromatic number. Discret. Appl. Math. 146, 106\u2013110 (2005)","journal-title":"Discret. Appl. Math."},{"key":"9288_CR20","unstructured":"Culberson, J.: Graph Coloring Page (2014). http:\/\/web.cs.ualberta.ca\/joe\/Coloring\/ . Accessed 20 Feb 2014"},{"issue":"3","key":"9288_CR21","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1145\/2480741.2480752","volume":"45","author":"M \u010crepin\u0161ek","year":"2013","unstructured":"\u010crepin\u0161ek, M., Liu, S.-H., Mernik, M.: Exploration and exploitation in evolutionary algorithms: a survey. ACM Comput. Surv. 45(3), 35 (2013)","journal-title":"ACM Comput. Surv."},{"key":"9288_CR22","volume-title":"The Origin of Species","author":"C Darwin","year":"1859","unstructured":"Darwin, C.: The Origin of Species. John Murray, London (1859)"},{"issue":"1","key":"9288_CR23","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1109\/TEVC.2010.2059031","volume":"15","author":"S Das","year":"2011","unstructured":"Das, S., Suganthan, P.N.: Differential evolution: a survey of the state-of-the-art. IEEE Trans. Evol. Comput. 15(1), 4\u201331 (2011)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"9288_CR24","doi-asserted-by":"crossref","unstructured":"Dorne, R., Hao, J.K.: A new genetic local search algorithm for graph coloring. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.P. (eds.) Parallel Problem Solving from Nature\u2014PPSN V, 5th International Conference, pp. 745\u2013754 (1998)","DOI":"10.1007\/BFb0056916"},{"key":"9288_CR25","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1080\/09720529.2005.10698054","volume":"8","author":"B Effantin","year":"2005","unstructured":"Effantin, B.: The b-chromatic number of power graphs of complete caterpillars. J. Discret. Math. Sci. Cryptogr. 8, 483\u2013502 (2005)","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"9288_CR26","first-page":"45","volume":"6","author":"B Effantin","year":"2003","unstructured":"Effantin, B., Kheddouci, H.: The b-chromatic number of some power graphs. Discret. Math. Theor. Comput. Sci. 6, 45\u201354 (2003)","journal-title":"Discret. Math. Theor. Comput. Sci."},{"key":"9288_CR27","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1080\/09720529.2005.10698024","volume":"8","author":"B Effantin","year":"2005","unstructured":"Effantin, B., Kheddouci, H.: Exact values for the b-chromatic number of a power complete $$k$$ k -ary tree. J. Discret. Math. Sci. Cryptogr. 8, 117\u2013129 (2005)","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"9288_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-05094-1","volume-title":"Introduction to Evolutionary Computing","author":"AE Eiben","year":"2003","unstructured":"Eiben, A.E., Smith, J.E.: Introduction to Evolutionary Computing. Springer, Berlin (2003)"},{"key":"9288_CR29","doi-asserted-by":"crossref","unstructured":"Elghazel, H., Deslandres, V., Hacid, M.-S. Dussauchoy, A., Kheddoucci, H.: A new clustering approach for symbolic data and its validation: application to the healthcare data. In: F. Esposito et all (Eds.) Proceedings of the International Conference on Foundations of Intelligent Systems\u2014ISMIS 2006, LNAI, vol. 4203, pp. 473\u2013482. Springer, Berlin (2006)","DOI":"10.1007\/11875604_54"},{"key":"9288_CR30","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."},{"key":"9288_CR31","volume-title":"Artificial Intelligence Through Simulated Evolution","author":"LJ Fogel","year":"1966","unstructured":"Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Through Simulated Evolution. Wiley, New York (1966)"},{"key":"9288_CR32","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/s10032-008-0070-8","volume":"11","author":"D Gaceb","year":"2008","unstructured":"Gaceb, D., Eglin, V., Lebourgeois, F., Emptoz, H.: Improvement of postal mail sorting system. Int. J. Document Anal. Recogn. 11, 67\u201380 (2008)","journal-title":"Int. J. Document Anal. Recogn."},{"key":"9288_CR33","first-page":"221","volume":"6","author":"D Gaceb","year":"2009","unstructured":"Gaceb, D., Eglin, V., Lebourgeois, F., Emptoz, H.: Robust approach of address block localization in business mail by graph coloring. Int. Arab. J. Inform. Tech. 6, 221\u2013229 (2009)","journal-title":"Int. Arab. J. Inform. Tech."},{"issue":"4","key":"9288_CR34","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":"9288_CR35","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":"9288_CR36","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."},{"issue":"5","key":"9288_CR37","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13(5), 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"key":"9288_CR38","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D Goldberg","year":"1996","unstructured":"Goldberg, D.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Boston (1996)"},{"issue":"4","key":"9288_CR39","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":"9288_CR40","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":"9288_CR41","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.dam.2005.04.001","volume":"152","author":"CT Hoang","year":"2005","unstructured":"Hoang, C.T., Kouider, M.: On the b-dominating coloring of graphs. Discret. Appl. Math. 152, 176\u2013186 (2005)","journal-title":"Discret. Appl. Math."},{"key":"9288_CR42","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1090.001.0001","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence. MIT Press, Cambridge, MA (1992)"},{"key":"9288_CR43","volume-title":"Fundamentals of Computer Algorithms","author":"E Horowitz","year":"1978","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press, Rockville (1978)"},{"key":"9288_CR44","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/S0166-218X(98)00146-2","volume":"91","author":"RW Irving","year":"1999","unstructured":"Irving, R.W., Manlove, D.F.: The b-chromatic number of a graph. Discret. Appl. Math. 91, 127\u2013141 (1999)","journal-title":"Discret. Appl. Math."},{"key":"9288_CR45","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s00373-010-0898-9","volume":"26","author":"M Jakovac","year":"2010","unstructured":"Jakovac, M., Klav\u017ear, S.: The b-chromatic number of cubic graphs. Graphs Comb. 26, 107\u2013118 (2010)","journal-title":"Graphs Comb."},{"key":"9288_CR46","first-page":"156","volume":"49","author":"M Jakovac","year":"2012","unstructured":"Jakovac, M., Peterin, I.: On the b-chromatic number of some products. Studia Sci. Math. Hung. 49, 156\u2013169 (2012)","journal-title":"Studia Sci. Math. Hung."},{"key":"9288_CR47","doi-asserted-by":"crossref","unstructured":"Jakovac, M., Peterin, I.: The b-chromatic index of a graph. Bull. Malays. Math. Sci. Soc. (2013) doi: 10.1007\/s40840-014-0088-7","DOI":"10.1007\/s40840-014-0088-7"},{"issue":"3","key":"9288_CR48","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":"9288_CR49","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"DS Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, vol. 26. American Mathematical Society, Providence (1996)"},{"key":"9288_CR50","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/S0012-365X(01)00469-1","volume":"256","author":"M Kouider","year":"2002","unstructured":"Kouider, M., Mah\u00e9o, M.: Some bounds for the b-chromatic number of a graph. Discret. Math. 256, 267\u2013277 (2002)","journal-title":"Discret. Math."},{"key":"9288_CR51","first-page":"49","volume":"44","author":"M Kouider","year":"2007","unstructured":"Kouider, M., Mah\u00e9o, M.: The b-chromatic number of the Cartesian product of two graphs. Studia Sci. Math. Hung. 44, 49\u201355 (2007)","journal-title":"Studia Sci. Math. Hung."},{"key":"9288_CR52","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.disc.2006.01.012","volume":"306","author":"M Kouider","year":"2006","unstructured":"Kouider, M., Zaker, M.: Bounds for the b-chromatic number of some families of graphs. Discret. Math. 306, 617\u2013623 (2006)","journal-title":"Discret. Math."},{"key":"9288_CR53","volume-title":"Genetic Programming 2: Automatic Discovery of Reusable Programs","author":"JR Koza","year":"1994","unstructured":"Koza, J.R.: Genetic Programming 2: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)"},{"key":"9288_CR54","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1007\/3-540-36379-3_27","volume":"2573","author":"J Kratochv\u00edl","year":"2002","unstructured":"Kratochv\u00edl, J., Tuza, Z., Voigt, M.: On the b-chromatic number of graphs. Lect. Notes Comput. Sci. 2573, 310\u2013320 (2002)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9288_CR55","doi-asserted-by":"crossref","DOI":"10.1090\/conm\/352","volume-title":"Graph Colorings","author":"M Kubale","year":"2004","unstructured":"Kubale, M.: Graph Colorings. American Mathematical Society, Providence (2004)"},{"issue":"6","key":"9288_CR56","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. bureau Stand. 84(6), 489\u2013506 (1979)","journal-title":"J. Res. Natl. bureau Stand."},{"key":"9288_CR57","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.endm.2013.10.003","volume":"44","author":"CVGC Lima","year":"2013","unstructured":"Lima, C.V.G.C., Martins, N.A., Sampaio, L., Santos, M.C., Silva, A.: b-Chromatic index of graphs. Electron. Notes Discret. Math. 44, 9\u201314 (2013)","journal-title":"Electron. Notes Discret. Math."},{"key":"9288_CR58","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"1","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: A memetic algorithm for graph coloring. Eur. J. Oper. Res. 1, 241\u2013250 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"9288_CR59","doi-asserted-by":"crossref","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 J. Comput. 20(2), 302\u2013316 (2008)","journal-title":"INFORMS J. Comput."},{"key":"9288_CR60","doi-asserted-by":"crossref","unstructured":"Malaguti, E., Toth, P.: A survey on vertex coloring problems. Int. Trans. Oper. Res. 17, 1\u201334, (2009)","DOI":"10.1111\/j.1475-3995.2009.00696.x"},{"key":"9288_CR61","unstructured":"Meringer, M.: Regular Graphs (2014). http:\/\/www.mathe2.uni-bayreuth.de\/markus\/reggraphs.html , Accessed 20 Feb 2014"},{"key":"9288_CR62","doi-asserted-by":"crossref","unstructured":"Sewell, E.C.: An improved algorithm for exact graph coloring, In D.S. Johnson and M.A. Trick, editors, Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 359\u2013376. American Mathematical Society, Providence (1996)","DOI":"10.1090\/dimacs\/026\/17"},{"issue":"4","key":"9288_CR63","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1023\/A:1008202821328","volume":"11","author":"R Storn","year":"1997","unstructured":"Storn, R., Price, K.: Differential evolution-a simple and efficient heuristic for global optimization over continuous spaces. J. Global. Optim. 11(4), 341\u2013359 (1997)","journal-title":"J. Global. Optim."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9288-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-015-9288-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-015-9288-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T14:30:43Z","timestamp":1651501843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-015-9288-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,14]]},"references-count":63,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,8]]}},"alternative-id":["9288"],"URL":"https:\/\/doi.org\/10.1007\/s10732-015-9288-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,14]]}}}