A polyhedral approach for the equitable coloring problem

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 t...

Full description

Saved in:
Bibliographic Details
Published inDiscrete Applied Mathematics Vol. 164; pp. 413 - 426
Main Authors Méndez-Díaz, Isabel, Nasini, Graciela, Severín, Daniel
Format Journal Article
LanguageEnglish
Published Elsevier B.V 19.02.2014
Subjects
Algorithms
Coloring
Cut and branch
Effectiveness
Equitable graph coloring
Inequalities
Integer programming
Mathematical analysis
Mathematical models
Polytopes
Programming
Integer programming
Equitable graph coloring
Cut and branch
Online AccessGet full text

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2012.11.018