{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,4]],"date-time":"2026-10-04T14:25:36Z","timestamp":1791123936725,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1066892","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"933-939","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Heuristic methods for graph coloring problems"],"prefix":"10.1145","author":[{"given":"A.","family":"Lim","sequence":"first","affiliation":[{"name":"Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.","family":"Zhu","sequence":"additional","affiliation":[{"name":"Hong Kong Univ of Sci & Tech, Clear Water Bay, Kowloon, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Q.","family":"Lou","sequence":"additional","affiliation":[{"name":"National Univ of Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"B.","family":"Rodrigues","sequence":"additional","affiliation":[{"name":"Singapore Management Univ, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/359094.359101"},{"key":"e_1_3_2_1_2_1","volume-title":"Proceedings of the Workshop on Industrial Constraint-Directed Scheduling","author":"Clements David P.","year":"1997","unstructured":"David P. Clements , James M. Crawford , David E. Joslin , Geoge L. Nemhauser , Markus E. Puttlitz , and Martin W. P. Savelsbergh . Heurstic optimization: A hybrid ai\/or approach . In Proceedings of the Workshop on Industrial Constraint-Directed Scheduling , 1997 . David P. Clements, James M. Crawford, David E. Joslin, Geoge L. Nemhauser, Markus E. Puttlitz, and Martin W. P. Savelsbergh. Heurstic optimization: A hybrid ai\/or approach. In Proceedings of the Workshop on Industrial Constraint-Directed Scheduling, 1997."},{"key":"e_1_3_2_1_3_1","volume-title":"Second DIMACS Implementation Challenge","author":"Joseph","year":"1993","unstructured":"Joseph C. Culberson and Feng Luo. Exploring the k-colorable landscape with iterative greedy. Cliques, Coloring and Satisfiability , Second DIMACS Implementation Challenge , 1993 . Joseph C. Culberson and Feng Luo. Exploring the k-colorable landscape with iterative greedy. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"Glover Fred","year":"1997","unstructured":"Fred Glover and Manuel Laguna . Tabu Search . Kluwer Acadamic Publishers , 1997 . Fred Glover and Manuel Laguna. Tabu Search. Kluwer Acadamic Publishers, 1997."},{"key":"e_1_3_2_1_5_1","volume-title":"Second DIMACS Implementation Challenge","author":"Glover Fred","year":"1993","unstructured":"Fred Glover , Mark Parker , and Jennifer Ryan . Coloring by tabu branch and bound. Cliques, Coloring and Satisfiability , Second DIMACS Implementation Challenge , 1993 . Fred Glover, Mark Parker, and Jennifer Ryan. Coloring by tabu branch and bound. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02239976"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.39.3.378"},{"key":"e_1_3_2_1_8_1","volume-title":"Second DIMACS Implementation Challenge","author":"Johnson David S.","year":"1993","unstructured":"David S. Johnson and Michael A. Trick (Editors) . Cliques, Coloring and Satisfiability , Second DIMACS Implementation Challenge . American Mathematical Society , 1993 . David S. Johnson and Michael A. Trick (Editors). Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge. American Mathematical Society, 1993."},{"key":"e_1_3_2_1_9_1","first-page":"340","volume-title":"Proceedings of American Association of Artificial Intelligence National Conference 1998","author":"David","year":"1998","unstructured":"David E. Joslin and David P. Clements, \"squeaky wheel\" optimization . In Proceedings of American Association of Artificial Intelligence National Conference 1998 , pages 340 -- 346 , 1998 . David E. Joslin and David P. Clements, \"squeaky wheel\" optimization. In Proceedings of American Association of Artificial Intelligence National Conference 1998, pages 340--346, 1998."},{"key":"e_1_3_2_1_10_1","volume-title":"Second DIMACS Implementation Challenge","author":"Lewandowski Gray","year":"1993","unstructured":"Gray Lewandowski and Anne Condon . Expreiments with parallel graph coloring heuristics and applications of graph coloring. Cliques, Coloring and Satisfiability , Second DIMACS Implementation Challenge , 1993 . Gray Lewandowski and Anne Condon. Expreiments with parallel graph coloring heuristics and applications of graph coloring. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993."},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of 4th Asia-Pacific Conference on Simulated Evolution and Learning","author":"Lim Andrew","year":"2002","unstructured":"Andrew Lim , Brian Rodrigues , and Yi Zhu . Crane scheduling using swo with local search . In Proceedings of 4th Asia-Pacific Conference on Simulated Evolution and Learning , 2002 . Andrew Lim, Brian Rodrigues, and Yi Zhu. Crane scheduling using swo with local search. In Proceedings of 4th Asia-Pacific Conference on Simulated Evolution and Learning, 2002."},{"key":"e_1_3_2_1_12_1","volume-title":"5th Metaheuristics International Conference (MIC 2003)","author":"Lim Andrew","year":"2002","unstructured":"Andrew Lim , Xingwen Zhang , and Yi Zhu . A hybrid method for the graph coloring problem and its generalizations . In 5th Metaheuristics International Conference (MIC 2003) , 2002 . Andrew Lim, Xingwen Zhang, and Yi Zhu. A hybrid method for the graph coloring problem and its generalizations. In 5th Metaheuristics International Conference (MIC 2003), 2002."},{"key":"e_1_3_2_1_13_1","volume-title":"Second DIMACS Implementation Challenge","author":"Morgenstern Craig","year":"1993","unstructured":"Craig Morgenstern . Distributed coloration neighborhood search. Cliques, Coloring and Satisfiability , Second DIMACS Implementation Challenge , 1993 . Craig Morgenstern. Distributed coloration neighborhood search. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993."},{"key":"e_1_3_2_1_14_1","first-page":"1772","volume-title":"Proceedings of Genetic and Evolutionary Computation Conference","author":"Park Eun-Jon","year":"2002","unstructured":"Eun-Jon Park , Yong-Hyuk Kim , and Byung-Ro Moon . Genetic search for fixed channel assignment problem with limited bandwidth . In Proceedings of Genetic and Evolutionary Computation Conference , pages 1772 -- 1779 , 2002 . Eun-Jon Park, Yong-Hyuk Kim, and Byung-Ro Moon. Genetic search for fixed channel assignment problem with limited bandwidth. In Proceedings of Genetic and Evolutionary Computation Conference, pages 1772--1779, 2002."},{"key":"e_1_3_2_1_15_1","volume-title":"Proceedings of Computational Symposium on Graph Coloring and its Generalizations","author":"Prestwich Steven","year":"2002","unstructured":"Steven Prestwich . Constrained bandwidth multicoloration neighborhoods . In Proceedings of Computational Symposium on Graph Coloring and its Generalizations , 2002 . Steven Prestwich. Constrained bandwidth multicoloration neighborhoods. In Proceedings of Computational Symposium on Graph Coloring and its Generalizations, 2002."},{"key":"e_1_3_2_1_16_1","volume-title":"Second DIMACS Implementation Challenge","author":"Sewell E. C.","year":"1993","unstructured":"E. C. Sewell . An improved algorithm for exact graph coloring. Cliques, Coloring and Satisfiability , Second DIMACS Implementation Challenge , 1993 . E. C. Sewell. An improved algorithm for exact graph coloring. Cliques, Coloring and Satisfiability, Second DIMACS Implementation Challenge, 1993."}],"event":{"name":"SAC05: The 2005 ACM Symposium on Applied Computing","location":"Santa Fe New Mexico","acronym":"SAC05","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1066892","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T14:28:10Z","timestamp":1673101690000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1066892"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":16,"alternative-id":["10.1145\/1066677.1066892","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1066892","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}