arXiv subjects

Isabel Méndez-Díaz

Publications and source records attributed to Isabel Méndez-Díaz.

4 recordsLinked to original sources

arXiv2014

A DSATUR-based algorithm for the Equitable Coloring Problem

This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem where the sizes of two arbitrary color classes differ in at most one unit. Based on the well known DSatur algorithm for the classic Coloring Problem, a new pruning criterion arising from equity constraints is proposed and analyzed. The good performance of the algorithm is shown through computational experiments over random and benchmark instances.

cs.DM↗

arXiv2014

An exact DSatur-based algorithm for the Equitable Coloring Problem

This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.

cs.DM↗

arXiv2011

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 the efficacy of these inequalities used in a cutting-plane algorithm.

cs.DM↗

arXiv2011

Polyhedral results 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 of the effectiveness of including these inequalities as cuts in a Branch & Cut algorithm.

cs.DM↗