Heuristic Methods for Graph Coloring Problems
Conference Proceeding Article
In this work, the Graph Coloring Problem and its generalizations - the Bandwidth Coloring Problem, the Multicoloring Problem and the Bandwidth Multicoloring Problem - are studied. A Squeaky Wheel Optimization with Tabu Search heuristic is developed and experiments using benchmark geometric test cases show that the algorithm performs well for these problems and achieves results for the Bandwidth Multicoloring Problem which improve on results obtained by other researchers.
Operations and Supply Chain Management
SAC '05: Proceedings of the 2005 ACM Symposium on Applied Computing, Santa Fe, New Mexico, March 13-17
City or Country
Sante Fe, Mexico
LIM, Andrew; ZHU, Yi; LOU, Q.; and RODRIGUES, Brian.
Heuristic Methods for Graph Coloring Problems. (2005). SAC '05: Proceedings of the 2005 ACM Symposium on Applied Computing, Santa Fe, New Mexico, March 13-17. 933-939. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2386