A variable neighborhood search for graph coloring.
type: Item
instance of: scholarly article
title: A variable neighborhood search for graph coloring.
zbMATH Open document ID: 1053.90050
DOI: 10.1016/S0377-2217(02)00832-9
author: Cédric Avanthay
author: Alain Hertz
author: Nicolas Zufferey
published in: European Journal of Operational Research
publication date: 2003-10-14T00:00:00Z
Mathematics Subject Classification ID: 90B40
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1992891
zbMATH Keywords: Variable neighborhood search
zbMATH Keywords: Graph coloring
MaRDI profile type: Publication
cites work: Q3056948
cites work: A new adaptive multi-start technique for combinatorial global optimizations
cites work: New methods to color the vertices of a graph
cites work: Chromatic Scheduling and the Chromatic Number Problem
cites work: Some experiments with simulated annealing for coloring graphs
cites work: Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs
cites work: Q5687258
cites work: Greedy randomized adaptive search procedures
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Q5687276
cites work: STABULUS: A technique for finding stable sets in large graphs with tabu search
cites work: Q4198056
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: Solving the maximum clique problem using a tabu search approach
cites work: Tabu Search—Part I
cites work: Tabu Search—Part II
cites work: Using tabu search techniques for graph coloring
cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
cites work: Q5687246
cites work: Optimization by Simulated Annealing
cites work: Variable neighborhood search
cites work: Q5752591
full work available at URL: s0377-2217(02)00832-9
OpenAlex ID: W1971493157
description: scientific article; zbMATH DE number 1992891