Title of article
Polyhedral results for the Equitable Coloring Problem
Author/Authors
Mendez-Diaz، نويسنده , , I. and Nasini، نويسنده , , G. and Severيn، نويسنده , , D.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2011
Pages
6
From page
159
To page
164
Abstract
In this work we study the polytope associated with a 0/1 integer programming formulation for the Equitable Coloring Problem. We find several families of valid inequalities and derive sufficient conditions in order to be facet-defining inequalities. We also present computational evidence of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.
Keywords
equitable graph coloring , Cut , branch & , integer programming
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2011
Journal title
Electronic Notes in Discrete Mathematics
Record number
1455676
Link To Document