{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T22:26:54Z","timestamp":1725575214969},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540240594"},{"type":"electronic","value":"9783540305491"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30549-1_55","type":"book-chapter","created":{"date-parts":[[2011,1,16]],"date-time":"2011-01-16T14:26:55Z","timestamp":1295188015000},"page":"636-645","source":"Crossref","is-referenced-by-count":1,"title":["A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem"],"prefix":"10.1007","author":[{"given":"Songshan","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Kong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Lim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","volume-title":"Trees and Proximity Representations","author":"J.P. Barthelemy","year":"1991","unstructured":"Barthelemy, J.P., Guenoche, A.: Trees and Proximity Representations. John Wiley Sons, New York (1991)"},{"key":"55_CR2","doi-asserted-by":"publisher","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. Communications of ACM\u00a022, 251\u2013256 (1979)","journal-title":"Communications of ACM"},{"doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Register allocation and spilling via graph coloring. In: SIGPLAN 1982 Symposium on Compiler Construction, Boston, Mass, June, vol.\u00a017, pp. 98\u2013105 (1982)","key":"55_CR3","DOI":"10.1145\/800230.806984"},{"key":"55_CR4","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a032, 260\u2013266 (1987)","journal-title":"European Journal of Operational Research"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02430368","volume":"1","author":"D. Costa","year":"1995","unstructured":"Costa, D., Hertz, A., Dubuis, O.: Embedding a sequential procedure within an evolutionary algorithm for coloring problems. Journal of Heuristics\u00a01, 105\u2013128 (1995)","journal-title":"Journal of Heuristics"},{"key":"55_CR6","first-page":"77","volume-title":"Chapter 6: Tabu search for graph coloring T-colorings and set T-colorings","author":"R. Dorne","year":"1998","unstructured":"Dorne, R., Hao, J.K.: Meta-heuristics: Advances and Trends in Local Search Paradigms for Optimization. In: Chapter 6: Tabu search for graph coloring T-colorings and set T-colorings, pp. 77\u201392. Kluwer Academic, Dordrecht (1998)"},{"key":"55_CR7","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 algorithm for graph coloring. Journal of Combinatorial Optimization\u00a03, 379\u2013397 (1999)","journal-title":"Journal of Combinatorial Optimization"},{"issue":"1","key":"55_CR8","doi-asserted-by":"publisher","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 Transactions of Vehicular Technology\u00a035(1), 8\u201314 (1986)","journal-title":"IEEE Transactions of Vehicular Technology"},{"key":"55_CR9","volume-title":"Computer and Intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computer and Intractability. Freeman, San Francisco (1979)"},{"unstructured":"Halldorsson, M.M.: A still better performance guarantee for approximate graph coloring. Technical Report 91-35, DIMACS, New Brunswick, NJ (1990)","key":"55_CR10"},{"issue":"3","key":"55_CR11","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.39.3.378","volume":"39","author":"D.S. 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. Operations Research\u00a039(3), 378\u2013406 (1991)","journal-title":"Operations Research"},{"key":"55_CR12","volume-title":"Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science","author":"D.S. Johnson","year":"1996","unstructured":"Johnson, D.S., Trick, M.A.: Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. American Mathematical Society, Providence (1996)"},{"unstructured":"Joslin, D.E., Clements, D.P.: Spueaky wheel optimization. In: the National Conference on Artificial Intelligence, AAAI-1998, Edmonton, Alberta, Canada (1998)","key":"55_CR13"},{"doi-asserted-by":"crossref","unstructured":"Kong, Y., Wang, F., Lim, A., Guo, S.S.: A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. In: Proceeding of Australian Conference on Artificial Intelligence 2003, pp. 125\u2013136 (2003)","key":"55_CR14","DOI":"10.1007\/978-3-540-24581-0_11"},{"key":"55_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-21711-5","volume-title":"Combinatorial Optimization","author":"B. Korte","year":"2002","unstructured":"Korte, B., Vygen, J.: Combinatorial Optimization, 2nd edn. Springer-Verlag, Heidelberg (2002)","edition":"2"},{"key":"55_CR16","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M. Kubale","year":"1985","unstructured":"Kubale, M., Jackowski, B.: A generalized implicit enumeration algorithm for graph coloring. Communications of the ACM\u00a028, 412\u2013418 (1985)","journal-title":"Communications of the ACM"},{"key":"55_CR17","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. John Wiley Sons, New York (1981)"},{"key":"55_CR18","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, vol.\u00a02, pp. 331\u2013395. Kluwer Academic Publishers, Dordrecht (1998)"},{"issue":"3","key":"55_CR19","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a0148(3), 546\u2013558 (2003)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","AI 2004: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30549-1_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,2]],"date-time":"2021-05-02T23:29:15Z","timestamp":1619998155000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30549-1_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540240594","9783540305491"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30549-1_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}