info:eu-repo/semantics/article
A polyhedral approach for the equitable coloring problem
Fecha
2014-02Registro en:
Méndez-Díaz, Isabel; Nasini, Graciela Leonor; Severin, Daniel Esteban; A polyhedral approach for the equitable coloring problem; Elsevier Science; Discrete Applied Mathematics; 164; Part 2; 2-2014; 413-426
0166-218X
CONICET Digital
CONICET
Autor
Méndez-Díaz, Isabel
Nasini, Graciela Leonor
Severin, Daniel Esteban
Resumen
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.