An effective heuristic algorithm for sum coloring of graphs
type: Item
instance of: scholarly article
title: An effective heuristic algorithm for sum coloring of graphs
zbMATH Open document ID: 1250.05114
author: Qinghua Wu
author: Jin-Kao Hao
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6107588
zbMATH Keywords: sum coloring
zbMATH Keywords: vertex coloring
zbMATH Keywords: independent set
zbMATH Keywords: heuristics
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: minimum sum coloring problem (MSCP)
describes a project that uses: EXTRACOL
describes a project that uses: DIMACS
MaRDI profile type: Publication
full work available at URL: j.cor.2011.09.010
OpenAlex ID: W2045790678
cites work: On chromatic sums and distributed resource allocation
cites work: Minimum Color Sum of Bipartite Graphs
cites work: Minimum sum set coloring of trees and line graphs of trees
cites work: A tabu search approach for the sum coloring problem
cites work: Q3097127
cites work: A survey of local search methods for graph coloring
cites work: Q4198056
cites work: Minimal coloring and strength of graphs
cites work: Approximation Results for the Optimum Cost Chromatic Partition Problem
cites work: Q5687246
cites work: A graph coloring algorithm for large scheduling problems
cites work: Lower bounds for the minimal sum coloring problem
cites work: Adaptive tabu search for course timetabling
cites work: A metaheuristic approach for the vertex coloring problem
cites work: An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
cites work: On sum coloring of graphs
cites work: Coloring large graphs based on independent set extraction
DOI: 10.1016/J.COR.2011.09.010
description: scientific article; zbMATH DE number 6107588