A column generation based algorithm for the robust graph coloring problem

Given an undirected simple graph G , an integer k , and a cost c i j for each pair of non-adjacent vertices in G , a robust coloring of G is the assignment of k colors to vertices such that adjacent vertices get different colors and the total penalty of the pairs of vertices having the same color is minimum. The problem has applications in fields such as timetabling and scheduling. We present a new formulation for the problem, which extends an existing formulation for the graph coloring problem. We also discuss a column generation based solution method. We report computational study on the performance of alternative formulations and the column generation method.

[1]  Javier Yáñez,et al.  The robust coloring problem , 2003, Eur. J. Oper. Res..

[2]  John Cocke,et al.  A methodology for the real world , 1981 .

[3]  Andrew Lim,et al.  Robust Graph Coloring for Uncertain Supply Chain Management , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[4]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[5]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[6]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[7]  John Cocke,et al.  Register Allocation Via Coloring , 1981, Comput. Lang..

[8]  Edmund K. Burke,et al.  On a Clique-Based Integer Programming Formulation of Vertex Colouring with Applications in Course Timetabling , 2007, ArXiv.

[9]  Gerhard J. Woeginger,et al.  Graph colorings , 2005, Theor. Comput. Sci..

[10]  Alain Hertz,et al.  A branch-and-price algorithm for the robust graph coloring problem , 2014, Discret. Appl. Math..

[11]  Vahid Lotfi,et al.  A graph coloring algorithm for large scale scheduling problems , 1986, Comput. Oper. Res..

[12]  Edmund K. Burke,et al.  A supernodal formulation of vertex colouring with applications in course timetabling , 2007, Ann. Oper. Res..

[13]  Isabel Méndez-Díaz,et al.  A Branch-and-Cut algorithm for graph coloring , 2006, Discret. Appl. Math..

[14]  Andrew Lim,et al.  A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem , 2003, Australian Conference on Artificial Intelligence.

[15]  Tomomi Matsui,et al.  Fractional programming formulation for the vertex coloring problem , 2014, Inf. Process. Lett..

[16]  Victor A. Campos,et al.  On the asymmetric representatives formulation for the vertex coloring problem , 2005, Electron. Notes Discret. Math..

[17]  Carlo Mannino,et al.  Models and solution techniques for frequency assignment problems , 2003, 4OR.

[18]  Andrew Lim,et al.  A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem , 2004, Australian Conference on Artificial Intelligence.

[19]  Yuri Frota,et al.  Cliques, holes and the vertex coloring polytope , 2004, Inf. Process. Lett..

[20]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[21]  Fan Wang,et al.  Metaheuristics for robust graph coloring , 2013, J. Heuristics.

[22]  Michael A. Trick,et al.  A Column Generation Approach for Graph Coloring , 1996, INFORMS J. Comput..