A column generation based algorithm for the robust graph coloring problem
Yüceoğlu, Birol and Şahin, Güvenç and Van Hoesel, Stan C.P.M. A column generation based algorithm for the robust graph coloring problem. Discrete Applied Mathematics . ISSN 0166-218X (Print) 1872-6771 (Online) Published Online First http://dx.doi.org/10.1016/j.dam.2016.09.006
This is the latest version of this item.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.dam.2016.09.006
Given an undirected simple graph G, an integer k, and a cost cij 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.
Available Versions of this Item
Repository Staff Only: item control page