A memetic algorithm for the minimum sum coloring problem

DOI10.1016/j.cor.2013.09.019zbMath1348.90598arXiv1304.2641OpenAlexW2048790889MaRDI QIDQ336939

Jin-Kao Hao, Jean-Philippe Hamiez, Yan Jin

Publication date: 10 November 2016

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

Full work available at URL: https://arxiv.org/abs/1304.2641

zbMATH Keywords

heuristicscombinatorial optimizationmemetic algorithmsum coloring

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Hybrid evolutionary search for the minimum sum coloring problem of graphs, A three-phased local search approach for the clique partitioning problem, An ILP based memetic algorithm for finding minimum positive influence dominating sets in social networks, Adaptive differential evolution algorithm with novel mutation strategies in multiple sub-populations, A systematic study on meta-heuristic approaches for solving the graph coloring problem, Iterated local search with tabu search for the weighted vertex coloring problem, Minimum sum coloring problem: upper bounds for the chromatic strength, 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, Uncertain vertex 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

Uses Software

• DIMACS
• Tabu search

Cites Work

• Using tabu search techniques for graph coloring
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring
• A memetic algorithm for graph coloring
• An effective heuristic algorithm for sum coloring of graphs
• Hybrid evolutionary algorithms for graph coloring
• Neighborhood portfolio approach for local search applied to timetabling problems
• Lower Bounds for the Minimal Sum Coloring Problem
• A Metaheuristic Approach for the Vertex Coloring Problem
• A Gentle Introduction to Memetic Algorithms
• Graph Colorings
• Unnamed Item
• Unnamed Item
• Unnamed Item