A variable neighborhood search for graph coloring C

@inproceedings{Avanthay2003AVN,
  title={A variable neighborhood search for graph coloring C},
  author={edric Avanthay and Alain Hertz and Nicolas Zufferey},
  year={2003}
}
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 metaheuristics have been proposed which extend in various ways this scheme and avoid being trapped in local optima. For example, Hansen and… CONTINUE READING