A Branch-and-Cut algorithm for graph coloring

In a previous work, we proposed a new integer programming formulation for the graph coloring problem which, to a certain extent, avoids symmetry. We studied the facet structure of the 0/1-polytope associated with it. Based on these theoretical results, we present now a Branch-and-Cut algorithm for the graph coloring problem. Our computational experiences compare favorably with the well-known exact graph coloring algorithm DSATUR. Keyword: Graph Coloring; Integer Programming; Branch-and-Cut algorithms

• Type: Journal
• Year: 2006
• Where: DAM
• Authors: Isabel Méndez-Díaz, Paula Zabala
• Keywords: Branch-and-cut Algorithms, DAM 2006, Graph Coloring, Graph Coloring Problem