Hybrid evolutionary search for the minimum sum coloring problem of graphs
type: Item
instance of: scholarly article
title: Hybrid evolutionary search for the minimum sum coloring problem of graphs
zbMATH Open document ID: 1398.68494
author: Yan Jin
author: Jin-Kao Hao
published in: Information Sciences
publication date: 2018-10-31T00:00:00Z
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6969340
zbMATH Keywords: sum coloring
zbMATH Keywords: hybrid search
zbMATH Keywords: evolutionary computing
zbMATH Keywords: local optimization
zbMATH Keywords: tabu search
describes a project that uses: Tabu search
describes a project that uses: Scatter Search
MaRDI profile type: Publication
full work available at URL: j.ins.2016.02.051
OpenAlex ID: W2289330054
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: New methods to color the vertices of a graph
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
cites work: Q4354785
cites work: Fundamentals of scatter search and path relinking
cites work: Using tabu search techniques for graph coloring
cites work: Approximation Results for the Optimum Cost Chromatic Partition Problem
cites work: A memetic algorithm for the minimum sum coloring problem
cites work: A graph coloring algorithm for large scheduling problems
cites work: Lower bounds for the minimal sum coloring problem
cites work: A memetic algorithm for graph coloring
cites work: Graph Colorings
cites work: A Gentle Introduction to Memetic Algorithms
cites work: Solving Scheduling Problems by Evolutionary Algorithms for Graph 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: \(\text{MA}\mid\text{PM}\): memetic algorithms with population management
cites work: An effective heuristic algorithm for sum coloring of graphs
DOI: 10.1016/J.INS.2016.02.051
description: scientific article; zbMATH DE number 6969340