Genetic and hybrid algorithms for graph coloring
type: Item
instance of: scholarly article
title: Genetic and hybrid algorithms for graph coloring
zbMATH Open document ID: 0851.90095
DOI: 10.1007/BF02125407
author: Charles Fleurent
author: Jacques A. Ferland
published in: Annals of Operations Research
publication date: 1996-07-28T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 68T05
zbMATH DE Number: 910215
zbMATH Keywords: genetic algorithms
zbMATH Keywords: graph coloring
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: The Reactive Tabu Search
cites work: New methods to color the vertices of a graph
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Dynamic tabu list management using the reverse elimination method
cites work: Q4321554
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: Q4198056
cites work: Future paths for integer programming and links to artificial intelligence
cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms)
cites work: Q4692508
cites work: Using tabu search techniques for graph coloring
cites work: Q4079017
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: A graph coloring algorithm for large scheduling problems
cites work: Computer Solutions of the Traveling Salesman Problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: Evolution algorithms in combinatorial optimization
cites work: A genetic approach to the quadratic assignment problem
cites work: Q3994378
description: scientific article; zbMATH DE number 910215