D'AMBROSIO C.

In this work we introduce and study the strong generalized minimum label spanning tree (GMLST), a novel optimization problem defined on edge-labeled graphs. Given a label set associated to each edge of the input graph, the aim is to look for the spanning tree using the minimum number of labels. Differently from the previously introduced GMLST...

In this work we introduce and study the strong generalized minimum label spanning tree (GMLST), a novel optimization problem defined on edge-labeled graphs. Given a label set associated to each edge of the input graph, the aim is to look for the spanning tree using the minimum number of labels. Differently from the previously introduced GMLST...

This paper studies the close-enough traveling salesman problem, a variant of the Euclidean traveling salesman problem in which the traveler visits a node if it passes through the neighborhood of that node. We introduce an improved version of the adaptive internal discretization scheme, recently proposed in the literature, and a heuristic that...

We consider a distribution problem in a supply chain consisting of multiple plants, multiple regional warehouses, and multiple customers. We focus on the problem of selecting a given number of warehouses among a set of candidate ones, assigning each customer to one or more of the selected warehouses while minimizing costs. We present a mixed...

We aim to maximize the operational time of a network of sensors, which are used to monitor a predefined set of target locations. The classical approach proposed in the literature consists in individuating subsets of sensors (covers) that can individually monitor the targets, and in assigning appropriate activation times to each cover. Indeed,...