A polyhedral approach for the Equitable Coloring Problem
Discrete Mathematics
2015-03-19 v2
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 that shows the efficacy of these inequalities used in a cutting-plane algorithm.
Keywords
Cite
@article{arxiv.1106.3348,
title = {A polyhedral approach for the Equitable Coloring Problem},
author = {Isabel Méndez-Díaz and Graciela Nasini and Daniel Severin},
journal= {arXiv preprint arXiv:1106.3348},
year = {2015}
}