{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:21:55Z","timestamp":1761895315308},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,7,22]],"date-time":"2011-07-22T00:00:00Z","timestamp":1311292800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10732-011-9180-4","type":"journal-article","created":{"date-parts":[[2011,7,21]],"date-time":"2011-07-21T16:16:07Z","timestamp":1311264967000},"page":"529-548","source":"Crossref","is-referenced-by-count":14,"title":["Metaheuristics for robust graph coloring"],"prefix":"10.1007","volume":"19","author":[{"given":"Fan","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,22]]},"reference":[{"issue":"1","key":"9180_CR1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"K.I. Aardal","year":"2007","unstructured":"Aardal, K.I., van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79\u2013129 (2007). ISSN: 0254-5330","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9180_CR2","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(2), 379\u2013388 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9180_CR3","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1016\/j.cor.2006.05.014","volume":"35","author":"I. Blochliger","year":"2008","unstructured":"Blochliger, 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."},{"key":"9180_CR4","first-page":"9","volume-title":"Proceedings of the 2nd International Conference on Electrical and Electronics Engineering","author":"R.L. Bracho","year":"2005","unstructured":"Bracho, R.L., Rodriguez, J.R., Martinez, F.J.Z.: Algorithms for robust graph coloring on paths. In: Proceedings of the 2nd International Conference on Electrical and Electronics Engineering, pp. 9\u201312 (2005)"},{"issue":"2","key":"9180_CR5","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1023\/A:1009625526657","volume":"5","author":"P. Cal\u00e9gari","year":"1999","unstructured":"Cal\u00e9gari, P., Coray, G., Hertz, A., Kobler, D., Kuonen, P.: A taxonomy of evolutionary algorithms in combinatorial optimization. J. Heuristics 5(2), 145\u2013158 (1999)","journal-title":"J. Heuristics"},{"key":"9180_CR6","first-page":"98","volume-title":"Proceedings of Symposium on Compiler Construction (ACM SIGPLAN \u201982)","author":"G.J. Chaitin","year":"1982","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. In: Proceedings of Symposium on Compiler Construction (ACM SIGPLAN \u201982), pp. 98\u2013105 (1982)"},{"issue":"2","key":"9180_CR7","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(2), 260\u2013266 (1987)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9180_CR8","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02430368","volume":"1","author":"D. Costa","year":"1995","unstructured":"Costa, D., Hertz, A., Dubuis, C.: Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs. J. Heuristics 1(1), 105\u2013128 (1995)","journal-title":"J. Heuristics"},{"key":"9180_CR9","first-page":"72","volume-title":"Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: Order-based genetic algorithms and the graph coloring problem. In: Handbook of Genetic Algorithms, pp. 72\u201390 (1991). Van Nostrand Reinhold Company"},{"key":"9180_CR10","first-page":"745","volume-title":"Lecture Notes in Computer Science","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.K.: A new genetic local search algorithm for graph coloring. In: Lecture Notes in Computer Science, pp. 745\u2013754. Springer, Berlin (1998)"},{"issue":"4","key":"9180_CR11","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":"9180_CR12","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":"9180_CR13","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-coloring problem. Discrete Appl. Math. 156(2), 267\u2013279 (2008)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9180_CR14","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/T-VT.1986.24063","volume":"35","author":"A. Gamst","year":"1986","unstructured":"Gamst, A.: Some lower bounds for a class of frequency assignment problems. IEEE Trans. Veh. Technol. 35(1), 8\u201314 (1986)","journal-title":"IEEE Trans. Veh. Technol."},{"key":"9180_CR15","volume-title":"Computer and Intractability: A guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability: A guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"9180_CR16","doi-asserted-by":"crossref","unstructured":"Glover, F., Lu, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR: Q. J. Oper. Res. 1\u201315 (2010)","DOI":"10.1007\/s10288-009-0115-y"},{"issue":"1","key":"9180_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0020-0190(93)90246-6","volume":"45","author":"M.M. Halldorsson","year":"1993","unstructured":"Halldorsson, M.M.: A still better performance guarantee for approximate graph coloring. Inf. Process. Lett. 45(1), 19\u201323 (1993)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"9180_CR18","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Hertz","year":"1987","unstructured":"Hertz, A., Werra, D.: Using tabu search techniques for graph coloring. Computing 39(4), 345\u2013351 (1987)","journal-title":"Computing"},{"issue":"3","key":"9180_CR19","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF02125407","volume":"63","author":"C. Fleurent","year":"1996","unstructured":"Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Ann. Oper. Res. 63(3), 437\u2013461 (1996). ISSN: 0254-5330","journal-title":"Ann. Oper. Res."},{"key":"9180_CR20","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1090\/dimacs\/026","volume-title":"Proceedings of the 2nd DIMACS Implementation Challenge: Cliques, Coloring, and Satisfiability","author":"D.S. Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.A.: DIMACS Series in Discrete Mathematics and Theoretical Computer Science. In: Proceedings of the 2nd DIMACS Implementation Challenge: Cliques, Coloring, and Satisfiability. vol. 26, pp. 98\u2013105. American Mathematical Society, Providence (1996)"},{"key":"9180_CR21","doi-asserted-by":"crossref","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. 378\u2013406 (1991)","DOI":"10.1287\/opre.39.3.378"},{"issue":"1","key":"9180_CR22","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G.A. Kochenberger","year":"2005","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139(1), 229\u2013241 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9180_CR23","first-page":"125","volume-title":"Lecture Notes in Computer Science","author":"Y. Kong","year":"2003","unstructured":"Kong, Y., Wang, F., Lim, A., Guo, S.S.: A new hybrid genetic algorithm for the robust graph coloring problem. In: Lecture Notes in Computer Science, pp.\u00a0125\u2013136. Springer, Berlin (2003)"},{"issue":"2","key":"9180_CR24","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1023\/A:1011237503342","volume":"19","author":"M. Laguna","year":"2001","unstructured":"Laguna, M., Mart\u00ed, R.: A GRASP for coloring sparse graphs. Comput. Optim. Appl. 19(2), 165\u2013178 (2001). ISSN: 0926-6003","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"9180_CR25","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) ISSN: 1475-3995","journal-title":"Int. Trans. Oper. Res."},{"issue":"2","key":"9180_CR26","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P. Merz","year":"2002","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. J. Heuristics 8(2), 197\u2013213 (2002)","journal-title":"J. Heuristics"},{"key":"9180_CR27","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1090\/dimacs\/026\/16","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","author":"C. Morgenstern","year":"1996","unstructured":"Morgenstern, C.: Distributed coloration neighborhood search. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11\u201313, 1993, p. 335 (1996)"},{"key":"9180_CR28","first-page":"479","volume-title":"The Theory and Applications of Graphs","author":"R.J. Opsut","year":"1981","unstructured":"Opsut, R.J., Roberts, F.S.: On the fleet maintenance, mobile radio frequency, task assignment and traffic phasing problems. In: The Theory and Applications of Graphs, pp. 479\u2013492. Wiley, New York (1981)"},{"key":"9180_CR29","first-page":"331","volume-title":"Handbook of Combinatorial Optimization","author":"P.M. Pardalos","year":"1998","unstructured":"Pardalos, P.M., Mavridou, T., Xue, J.: The graph coloring problems: a bibliographic survey. In: Handbook of Combinatorial Optimization, pp. 331\u2013395. Kluwer Academic, Amsterdam (1998)"},{"issue":"3","key":"9180_CR30","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1016\/S0377-2217(02)00362-4","volume":"148","author":"J. Yanez","year":"2003","unstructured":"Yanez, J., Ramirez, J.: The robust coloring problem. Eur. J. Oper. Res. 148(3), 546\u2013558 (2003)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"9180_CR31","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\/content\/pdf\/10.1007\/s10732-011-9180-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9180-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9180-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T05:23:09Z","timestamp":1560403389000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9180-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,22]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9180"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9180-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,22]]}}}