UNIGE document Scientific Article
previous document  unige:26178  next document
add to browser collection

A variable neighborhood search for graph coloring

Avanthay, Cédric
Hertz, Alain
Published in European Journal of Operational Research. 2003, vol. 151, p. 379-388
Abstract Descent methods for combinatorial optimization proceed by performing a sequence of local changes on an initial solution which improve each time the value of an objective function until a local optimum is found. Several meta-heuristics have been proposed which extend in various ways this scheme and avoid being trapped in local optima. For example, Hansen and Mladenovic have recently proposed the variable neighborhood search method which has not yet been applied to many combinatorial optimization problems. The aim of this paper is to propose an adaptation of this new method to the graph coloring problem.
Keywords Variable neighborhood searchGraph coloring
Full text
Article (Published version) (246 Kb) - document accessible for UNIGE members only Limited access to UNIGE
(ISO format)
AVANTHAY, Cédric, HERTZ, Alain, ZUFFEREY, Nicolas. A variable neighborhood search for graph coloring. In: European Journal of Operational Research, 2003, vol. 151, p. 379-388. https://archive-ouverte.unige.ch/unige:26178

344 hits

0 download


Deposited on : 2013-02-04

Export document
Format :
Citation style :