Neutrality in the Graph Coloring Problem - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Neutrality in the Graph Coloring Problem


In this paper, the neutrality of some hard instances of the graph coloring problem (GCP) is quantified. This neutrality property has to be detected as it impacts the search process. Indeed, local optima may belong to plateaus that represent a barrier for local search methods. Then, we also aim at pointing out the interest of exploiting neutrality during the search. Therefore, a generic local search dedicated to neutral problems, NILS, is performed on several hard instances.
No file

Dates and versions

hal-00919750 , version 1 (17-12-2013)


  • HAL Id : hal-00919750 , version 1


Marie-Eleonore Marmion, Aymeric Blot, Laetitia Jourdan, Clarisse Dhaenens. Neutrality in the Graph Coloring Problem. Learning and Intelligent OptimizatioN Conference, Jan 2013, Catania, Italy. pp.125--130. ⟨hal-00919750⟩
91 View
0 Download


Gmail Facebook X LinkedIn More