Corrigendum to ``Variable space search for graph coloring [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)]

DOI10.1016/j.dam.2008.11.008zbMath1237.05076OpenAlexW2468582779MaRDI QIDQ1028098

Nicolas Zufferey, Matthieu Plumettaz, Alain Hertz

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.11.008

zbMATH Keywords

local searchgraph coloringvariable space search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

A formulation space search heuristic for packing unequal circles in a fixed size circular container, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, A heuristic for the circle packing problem with a variety of containers, A note on solving MINLP's using formulation space search, Packing a fixed number of identical circles in a circular container with circular prohibited areas

Cites Work

• Unnamed Item
• Variable neighborhood search
• A variable neighborhood search for graph coloring.
• Reformulation descent applied to circle packing problems
• On edge orienting methods for graph coloring