Abstract
Abstract The sum coloring problem has many applications in scheduling. It is a variant of the vertex coloring problem where the objective is to minimize the sum of colors used in coloring the vertices. In this paper, we use tabu search to solve the sum coloring problem. Experiments are performed on instances extracted from the second DIMACS challenge. Results show significative improvements on some chromatic sum bounds.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
