Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
type: Item
instance of: scholarly article
title: Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
zbMATH Open document ID: 0855.05063
DOI: 10.1007/BF02430368
author: D. G. Costa
author: Alain Hertz
author: Olivier Dubuis
published in: Journal of Heuristics
publication date: 1995-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 91B99
zbMATH DE Number: 922549
zbMATH Keywords: \(q\)-stability number
zbMATH Keywords: sequential methods
zbMATH Keywords: evolutionary procedure
zbMATH Keywords: optimization problems
zbMATH Keywords: coloring problems
zbMATH Keywords: chromatic number
describes a project that uses: TABARIS
MaRDI profile type: Publication
cites work: Minimax relations for the partial q-colorings of a graph
cites work: Q3950588
cites work: New methods to color the vertices of a graph
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
cites work: An Evolutionary Tabu Search Algorithm And The NHL Scheduling Problem
cites work: EPCOT: An efficient procedure for coloring optimally with Tabu Search
cites work: Simulated annealing: A tool for operational research
cites work: Q4321554
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: TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph
cites work: Q4198056
cites work: Q4692508
cites work: Scatter search and star-paths: Beyond the genetic metaphor
cites work: A user's guide to tabu search
cites work: Polynomially solvable cases for the maximum stable set problem
cites work: Using tabu search techniques for graph coloring
cites work: Q4365130
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Optimization by Simulated Annealing
cites work: Genetic algorithms: Foundations and applications
cites work: An exact algorithm for the maximum stable set problem
cites work: An introduction to population approaches for optimization and hierarchical objective functions: A discussion on the role of tabu search
cites work: Evolution algorithms in combinatorial optimization
cites work: Q4495496
full work available at URL: https://doi.org/10.1007/bf02430368
OpenAlex ID: W2083518001
description: scientific article; zbMATH DE number 922549