On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
type: Item
instance of: scholarly article
title: On a parallel genetic-tabu search based algorithm for solving the graph colouring problem
zbMATH Open document ID: 1176.90482
author: Bchira Ben Mabrouk
author: Hamadi Hasni
author: Z. Mahjoub
published in: European Journal of Operational Research
publication date: 2009-12-07T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5642810
zbMATH Keywords: genetic algorithms
zbMATH Keywords: graph colouring
zbMATH Keywords: hybridation
zbMATH Keywords: parallelisation
zbMATH Keywords: tabu search
MaRDI profile type: Publication
full work available at URL: j.ejor.2008.03.050
OpenAlex ID: W2041132551
cites work: A variable neighborhood search for graph coloring.
cites work: Random graphs.
cites work: New methods to color the vertices of a graph
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Ants can colour graphs
cites work: Q4418381
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Q2770494
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: A survey of local search methods for graph coloring
cites work: Q4198056
cites work: Q4813178
cites work: Q4736905
cites work: Using tabu search techniques for graph coloring
cites work: A GRASP for coloring sparse graphs
cites work: A graph coloring algorithm for large scheduling problems
DOI: 10.1016/J.EJOR.2008.03.050
description: scientific article; zbMATH DE number 5642810