A cooperative search method for the \(k\)-coloring problem
type: Item
instance of: scholarly article
title: A cooperative search method for the \(k\)-coloring problem
zbMATH Open document ID: 1139.05343
author: Hend Bouziri
author: El-Ghazali Talbi
author: Khaled Mellouli
published in: JMMA. Journal of Mathematical Modelling and Algorithms
publication date: 2008-06-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68P10
zbMATH DE Number: 5287737
zbMATH Keywords: fitness landscape
zbMATH Keywords: cooperative method
zbMATH Keywords: iterative search
MaRDI profile type: Publication
full work available at URL: s10852-008-9081-1
OpenAlex ID: W4301383419
cites work: New methods to color the vertices of a graph
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Frozen development in graph coloring
cites work: Genetic and hybrid algorithms for graph coloring
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: An adaptive memory algorithm for the \(k\)-coloring problem
cites work: A survey of local search methods for graph coloring
cites work: Using tabu search techniques for graph coloring
cites work: Local optima topology for the \(k\)-coloring problem
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Q5687262
DOI: 10.1007/S10852-008-9081-1
description: scientific article; zbMATH DE number 5287737