5 citations · 10 across the 5 of their papers we have counts for
6 papers
Double-Partition Coloring problem: a unified approach for conflict-free coloring of hypergraphs and other coloring problems in graphs
Mauro Lucci, Graciela Nasini, Paola Tolomei +1
The Double-Partition Coloring Problem (DPCP) is a recently introduced generalization of several coloring problems on graphs and hypergraphs, including the Partition Coloring Proble…
Capacitated power dominating set problem: a solution approach based on forbidden propagation sets
Mauro Lucci, Diego Delle Donne, Mariana Escalante
The optimal placement of measurement devices in electrical power systems is commonly modeled through the power dominating set problem. However, in real-world applications, these de…
Exact resolution of a simultaneous vehicle routing and crew scheduling problem in long-haul transport
Mauro Lucci, Daniel Severin, Paula Zabala
This work focuses on exact methods for a Simultaneous Vehicle Routing and Crew Scheduling Problem in long-haul transport. Pickup-and-delivery requests with time windows must be ful…
Solving the List Coloring Problem through a Branch-and-Price algorithm
Mauro Lucci, Daniel Severin, Graciela Nasini
In this work, we present a branch-and-price algorithm to solve the weighted version of the List Coloring Problem, based on a vertex cover formulation by stable sets. This problem i…
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
Mauro Lucci, Daniel Severín, Paula Zabala
A vehicle routing and crew scheduling problem (VRCSP) consists of simultaneously planning the routes of a fleet of vehicles and scheduling the crews, where the vehicle-crew corresp…
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…