An effective heuristic algorithm for sum coloring of graphs

DOI10.1016/j.cor.2011.09.010zbMath1250.05114OpenAlexW2045790678MaRDI QIDQ1762148

Jin-Kao Hao, Qinghua Wu

Publication date: 15 November 2012

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2011.09.010

zbMATH Keywords

heuristicsindependent setheuristic algorithmvertex coloringsum coloringminimum sum coloring problem (MSCP)

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (11)

Hybrid evolutionary search for the minimum sum coloring problem of graphs ⋮ A review on algorithms for maximum clique problems ⋮ A memetic algorithm for the minimum sum coloring problem ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ New variable neighborhood search method for minimum sum coloring problem on simple graphs ⋮ A branch-and-price algorithm for the minimum sum coloring problem ⋮ ILP models and column generation for the minimum sum coloring problem ⋮ Computing lower bounds for minimum sum coloring and optimum cost chromatic partition ⋮ Combining CP and ILP in a tree decomposition of bounded height for the sum colouring problem ⋮ Team selection for prediction tasks

Uses Software

• EXTRACOL
• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum sum set coloring of trees and line graphs of trees
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• On chromatic sums and distributed resource allocation
• Coloring large graphs based on independent set extraction
• On sum coloring of graphs
• Minimal coloring and strength of graphs
• Adaptive tabu search for course timetabling
• A survey of local search methods for graph coloring
• Lower Bounds for the Minimal Sum Coloring Problem
• A Metaheuristic Approach for the Vertex Coloring Problem
• A graph coloring algorithm for large scheduling problems
• Minimum Color Sum of Bipartite Graphs
• Approximation Results for the Optimum Cost Chromatic Partition Problem

This page was built for publication: An effective heuristic algorithm for sum coloring of graphs