This paper addresses a variant of the classical Traveling Salesman Problem known as Close-Enough Traveling Salesman Problem. In this problem, there is a set of nodes (customers, targets), each of them associated with a region, denoted as neighborhood, that contains it. The goal is to determine the shortest tour that visits all the nodes, where...
-
2022 (v1)PublicationUploaded on: July 7, 2023
-
2019 (v1)Publication
The Minimum Conflict Weighted Spanning Tree Problem is a variant of the Minimum Spanning Tree Problem in which, given a list of conflicting edges modelled as a conflict graph, we want to find a weighted spanning tree with the minimum number of conflicts as main objective function and minimize the total weight of spanning trees as secondary...
Uploaded on: April 14, 2023 -
2021 (v1)Publication
Image analysis is a branch of signal analysis that focuses on the extraction of meaningful information from images through digital image processing techniques. Convolution is a technique used to enhance specific characteristics of an image, while deconvolution is its inverse process. In this work, we focus on the deconvolution process, defining...
Uploaded on: March 27, 2023