Solving the minimum sum coloring problem via binary quadratic programming

In recent years, binary quadratic programming (BQP) has been successfully applied to solve several combinatorial optimization problems. We consider in this paper a study of using the BQP model to solve the minimum sum coloring problem (MSCP). For this purpose, we recast the MSCP with a quadratic model which is then solved via a recently proposed Path Relinking (PR) algorithm designed for the general BQP. Based on a set of MSCP benchmark instances, we investigate the performance of this solution approach compared with existing methods.

[1]  Paul Erdös,et al.  Tight bounds on the chromatic sum of a connected graph , 1989, J. Graph Theory.

[2]  Fred W. Glover,et al.  Probabilistic GRASP-Tabu Search algorithms for the UBQP problem , 2013, Comput. Oper. Res..

[3]  Zbigniew Kokosinski,et al.  On Sum Coloring of Graphs with Parallel Genetic Algorithms , 2007, ICANNGA.

[4]  Mark W. Lewis,et al.  A new approach for modeling and solving set packing problems , 2008, Eur. J. Oper. Res..

[5]  Jin-Kao Hao,et al.  An effective heuristic algorithm for sum coloring of graphs , 2012, Comput. Oper. Res..

[6]  Hossein Hajiabolhassan,et al.  Minimal coloring and strength of graphs , 2000, Discret. Math..

[7]  Fred Glover,et al.  Scatter Search and Path Relinking: Advances and Applications , 2003, Handbook of Metaheuristics.

[8]  Fred W. Glover,et al.  Path relinking for unconstrained binary quadratic programming , 2012, Eur. J. Oper. Res..

[9]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[10]  Fred W. Glover,et al.  An effective modeling and solution approach for the generalized independent set problem , 2006, Optim. Lett..

[11]  Marco Chiarandini,et al.  A local search heuristic for chromatic sum , 2011 .

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Ewa Kubicka,et al.  An introduction to chromatic sums , 1989, CSC '89.

[14]  Leo G. Kroon,et al.  The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs , 1996, WG.

[15]  Mihir Bellare,et al.  On Chromatic Sums and Distributed Resource Allocation , 1998, Inf. Comput..

[16]  Klaus Jansen,et al.  Approximation Results for the Optimum Cost Chromatic Partition Problem , 1997, J. Algorithms.

[17]  S. GarfinkelR.,et al.  The Set-Partitioning Problem , 1969 .

[18]  Mohammad R. Salavatipour,et al.  On Sum Coloring of Graphs , 2003, Discret. Appl. Math..

[19]  Aziz Moukrim,et al.  Greedy Algorithms for the Minimum Sum Coloring Problem , 2009 .

[20]  Hend Bouziri,et al.  A tabu search approach for the sum coloring problem , 2010, Electron. Notes Discret. Math..

[21]  Mark W. Lewis,et al.  A new modeling and solution approach for the set-partitioning problem , 2008, Comput. Oper. Res..

[22]  Javier Marenco,et al.  Minimum sum set coloring of trees and line graphs of trees , 2011, Discret. Appl. Math..

[23]  Fred W. Glover,et al.  A unified modeling and solution framework for combinatorial optimization problems , 2004, OR Spectr..

[24]  Stephen J. Wright,et al.  Quadratic programming , 2015 .

[25]  Guy Kortsarz,et al.  The Minimum Color Sum of Bipartite Graphs , 1997, ICALP.

[26]  Sidi Mohamed Douiri,et al.  New Algorithm for the Sum Coloring Problem , 2011 .

[27]  Fred W. Glover,et al.  Solving the maximum edge weight clique problem via unconstrained quadratic programming , 2007, Eur. J. Oper. Res..