Variable space search for graph coloring
type: Item
instance of: scholarly article
title: Variable space search for graph coloring
zbMATH Open document ID: 1213.05085
author: Alain Hertz
author: Matthieu Plumettaz
author: Nicolas Zufferey
published in: Discrete Applied Mathematics
publication date: 2008-11-19T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5369026
zbMATH Keywords: graph coloring
zbMATH Keywords: local search
zbMATH Keywords: variable space search
describes a project that uses: Tabu search
MaRDI profile type: Publication
full work available at URL: j.dam.2008.03.022
OpenAlex ID: W2021735068
cites work: A variable neighborhood search for graph coloring.
cites work: A graph coloring heuristic using partial solutions and a reactive tabu scheme
cites work: Chromatic Scheduling and the Chromatic Number Problem
cites work: Efficient algorithms for finding critical subgraphs
cites work: A branch-and-cut algorithm for graph coloring
cites work: Genetic and hybrid algorithms for graph coloring
cites work: Hybrid evolutionary algorithms for graph coloring
cites work: A survey of local search methods for graph coloring
cites work: Q5545303
cites work: Q4198056
cites work: On edge orienting methods for graph coloring
cites work: Q4354785
cites work: Finding the chromatic number by means of critical graphs
cites work: Using tabu search techniques for graph coloring
cites work: An adaptive memory algorithm for the \(k\)-coloring problem
cites work: A metaheuristic approach for the vertex coloring problem
cites work: A Column Generation Approach for Graph Coloring
cites work: Variable neighborhood search
cites work: Reformulation descent applied to circle packing problems
cites work: Q5687262
cites work: Nombre chromatique et plus longs chemins d'un graphe
DOI: 10.1016/J.DAM.2008.03.022
description: scientific article; zbMATH DE number 5369026