Polyhedral results for the Equitable Coloring Problem
Discrete Mathematics
2014-05-28 v1
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.
Cite
@article{arxiv.1106.3349,
title = {Polyhedral results for the Equitable Coloring Problem},
author = {Isabel Méndez-Díaz and Graciela Nasini and Daniel Severin},
journal= {arXiv preprint arXiv:1106.3349},
year = {2014}
}