23 citations · 82 across the 13 of their papers we have counts for
11 papers · 1 filter
A Branch and Price Algorithm for List Coloring Problem
Mauro Lucci, Graciela Nasini, Daniel Severín
Coloring problems in graphs have been used to model a wide range of real applications. In particular, the List Coloring Problem generalizes the well-known Graph Coloring Problem fo…
The polytope of legal sequences
Manoel Campêlo, Daniel Severín
A sequence of vertices in a graph is called a \emph{(total) legal dominating sequence} if every vertex in the sequence (total) dominates at least one vertex not dominated by those…
Cross-identification of stellar catalogs with multiple stars: Complexity and Resolution
Daniel Severin
In this work, I present an optimization problem which consists of assigning entries of a stellar catalog to multiple entries of another stellar catalog such that the probability of…
An Exact Approach for the Balanced k-Way Partitioning Problem with Weight Constraints and its Application to Sports Team Realignment
Diego Recalde, Daniel Severín, Ramiro Torres +1
In this work a balanced k-way partitioning problem with weight constraints is defined to model the sports team realignment. Sports teams must be partitioned into a fixed number of…
On the additive chromatic number of several families of graphs
Daniel Severin
The Additive Coloring Problem is a variation of the Coloring Problem where labels of are assigned to the vertices of a graph so that the sum of labels over the…
On the Packing Chromatic Number on Hamming Graphs and General Graphs
Graciela Nasini, Daniel Severin, Pablo Torres
The packing chromatic number of a graph is the smallest integer needed to proper color the vertices of in such a way the distance between any two vertices havi…
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…
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…