23 citations · 38 across the 4 of their papers we have counts for
6 papers
A tabu search heuristic for the Equitable Coloring Problem
Isabel Méndez Díaz, Graciela Nasini, Daniel Severín
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arbitrary color classes differ in at most one unit. This additional condition, call…
An exact DSatur-based algorithm for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severín
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 specifi…
Projective Splitting Algorithms for Integer Linear Programming Part 1: Pure Integer Programs
Federico Rodes, Isabel Mendez-Diaz, Paula Zabala
We propose a new exact approach for solving integer linear programming (ILP) problems which we will call projective splitting algorithms (PSAs). Unlike classical methods for solvin…
A DSATUR-based algorithm for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
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 o…
Polyhedral results for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
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 deri…
A polyhedral approach for the Equitable Coloring Problem
Isabel Méndez-Díaz, Graciela Nasini, Daniel Severin
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 deri…