The priority-based coloring approach to register allocation
ACM Transactions on Programming Languages and Systems (TOPLAS)
New methods to color the vertices of a graph
Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A new algorithm for the maximum-weight clique problem
Nordic Journal of Computing
A Heuristic Method for the Set Covering Problem
Operations Research
Finding the chromatic number by means of critical graphs
Journal of Experimental Algorithmics (JEA)
Using Extra Dual Cuts to Accelerate Column Generation
INFORMS Journal on Computing
A graph coloring heuristic using partial solutions and a reactive tabu scheme
Computers and Operations Research
An adaptive memory algorithm for the k-coloring problem
Discrete Applied Mathematics
A cutting plane algorithm for graph coloring
Discrete Applied Mathematics
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Simple ingredients leading to very efficient heuristics for the maximum clique problem
Journal of Heuristics
A Metaheuristic Approach for the Vertex Coloring Problem
INFORMS Journal on Computing
A Branch-and-Cut algorithm for graph coloring
Discrete Applied Mathematics - Special issue: IV ALIO/EURO workshop on applied combinatorial optimization
Safe lower bounds for graph coloring
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A new DSATUR-based algorithm for exact vertex coloring
Computers and Operations Research
Hi-index | 0.00 |
Given an undirected graph G=(V,E), the Vertex Coloring Problem (VCP) requires to assign a color to each vertex in such a way that colors on adjacent vertices are different and the number of colors used is minimized. In this paper, we present an exact algorithm for the solution of VCP based on the well-known Set Covering formulation of the problem. We propose a Branch-and-Price algorithm embedding an effective heuristic from the literature and some methods for the solution of the slave problem, as well as two alternative branching schemes. Computational experiments on instances from the literature show the effectiveness of the algorithm, which is able to solve, for the first time to proven optimality, five of the benchmark instances in the literature, and reduce the optimality gap of many others.