An effective heuristic algorithm for sum coloring of graphs
- 1 July 2012
- journal article
- Published by Elsevier BV in Computers & Operations Research
- Vol. 39 (7), 1593-1600
- https://doi.org/10.1016/j.cor.2011.09.010
Abstract
No abstract availableKeywords
Funding Information
- Region of “Pays de la Loire” (France)
This publication has 15 references indexed in Scilit:
- Coloring large graphs based on independent set extractionComputers & Operations Research, 2012
- An adaptive multistart tabu search approach to solve the maximum clique problemJournal of Combinatorial Optimization, 2011
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloringComputers & Operations Research, 2010
- A tabu search approach for the sum coloring problemElectronic Notes in Discrete Mathematics, 2010
- Lower Bounds for the Minimal Sum Coloring ProblemElectronic Notes in Discrete Mathematics, 2010
- Adaptive Tabu Search for course timetablingEuropean Journal of Operational Research, 2010
- A survey of local search methods for graph coloringComputers & Operations Research, 2006
- Minimal coloring and strength of graphsDiscrete Mathematics, 2000
- Approximation Results for the Optimum Cost Chromatic Partition ProblemJournal of Algorithms, 2000
- Minimum Color Sum of Bipartite GraphsJournal of Algorithms, 1998