A column generation based algorithm for the robust graph coloring problem

Warning The system is temporarily closed to updates for reporting purpose.

Yüceoğlu, Birol and Şahin, Güvenç and Van Hoesel, Stan C. P. M. (2017) A column generation based algorithm for the robust graph coloring problem. Discrete Applied Mathematics, 217 (Part: 2). pp. 340-352. ISSN 0166-218X (Print) 1872-6771 (Online)

This is the latest version of this item.

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader

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.

Item Type:Article
Uncontrolled Keywords:Robust graph coloring; Representatives formulation; Set-covering formulation; Column generation; Reduced cost fixing
Subjects:T Technology > T Technology (General) > T055.4-60.8 Industrial engineering. Management engineering > T57.6-57.97 Operations research. Systems analysis
ID Code:33673
Deposited By:Güvenç Şahin
Deposited On:10 Sep 2017 18:22
Last Modified:22 May 2019 13:56

Available Versions of this Item

Repository Staff Only: item control page