A Branch-and-Price Approach for Graph Multi-Coloring

We present a branch-and-price framework for solving the graph multi-coloring problem. We propose column generation to implicitly optimize the linear programming relaxation of an independent set formulation (where there is one variable for each independent set in the graph) for graph multi-coloring. This approach, while requiring the solution of a difficult subproblem, is a promising method to obtain good solutions for small to moderate size problems quickly. Some implementation details and initial computational experience are presented.

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

[2]  A. Mehrotra,et al.  A column generation approach for exact graph coloring , 1994 .

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

[4]  G. Nemhauser,et al.  BRANCH-AND-PRICE: GENERATION FOR SOLVING HUGE INTEGER PROGRAMS , 1998 .

[5]  Egon Balas,et al.  Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1992, SIAM J. Comput..

[6]  B. Pittel.  On the probable behaviour of some algorithms for finding the stability number of a graph , 1982, Mathematical Proceedings of the Cambridge Philosophical Society.

[7]  Mark Jerrum,et al.  Large Cliques Elude the Metropolis Process , 1992, Random Struct. Algorithms.

[8]  Egon Balas,et al.  Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1991, SIAM J. Comput..

[9]  Lata Narayanan,et al.  Channel assignment and graph multicoloring , 2002 .

[10]  Ellis L. Johnson.  Modelling and strong linear programs for mixed integer programming , 1989 .

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

[12]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[13]  Egon Balas,et al.  A node covering algorithm , 1977 .

[14]  Michael A. Trick,et al.  Cliques and clustering: A combinatorial approach , 1998, Oper. Res. Lett..

[15]  Edward G. Coffman,et al.  Scheduling File Transfers , 1985, SIAM J. Comput..

[16]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[17]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[18]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[19]  Steven David Prestwich,et al.  Generalised graph colouring by a hybrid of local search and constraint programming , 2008, Discret. Appl. Math..