New Integer Linear Programming Models for the Vertex Coloring Problem
The vertex coloring problem asks for the minimum number of colors that can be assigned to the vertices of a given graph such that each two neighbors have different colors. The problem is NP-hard. Here, we introduce new integer linear programming formulations based on partial-ordering. They have the advantage that they are as simple to work with as the classical assignment formulation, since they can be fed directly into a standard integer linear programming solver. We evaluate our new models using Gurobi and show that our new simple approach is a good alternative to the best state-of-the-art approaches for the vertex coloring problem. In our computational experiments, we compare our formulations with the classical assignment formulation and the representatives formulation on a large set of benchmark graphs as well as randomly generated graphs of varying size and density. The evaluation shows that the partial-ordering based models dominate both formulations for sparse graphs, while the representatives formulation is the best for dense graphs.
KeywordsGraph coloring Vertex coloring Integer linear programming
This work was partially supported by DFG, RTG 1855.
- 5.Campos, V., Corrêa, R.C., Delle Donne, D., Marenco, J., Wagler, A.: Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation. ArXiv e-prints, August 2015Google Scholar
- 7.Benchmarking machines and testing solutions (2002). http://mat.gsia.cmu.edu/COLOR02/BENCHMARK/benchmark.tar
- 9.Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, CA, USA (1979)Google Scholar
- 10.Gualandi, S. Chiarandini, M.: Graph coloring instances (2017). https://sites.google.com/site/graphcoloring/vertex-coloring
- 15.Jabrayilov, A., Mutzel, P. (2017). https://ls11-www.cs.tu-dortmund.de/mutzel/colorbenchmarks
- 16.Johnson, D.S., Trick, M. (eds.): Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. AMS, Providence (1996)Google Scholar
- 23.Sewell, E.: An improved algorithm for exact graph coloring. In: Johnson and Trick , pp. 359–373Google Scholar
- 24.Trick, M.: DIMACS graph coloring instances (2002). http://mat.gsia.cmu.edu/COLOR02/