Browsing Investigación y publicaciones by Author "Marenco, Javier"
Now showing items 1-7 of 7
-
A branch-and-cut algorithm for the routing and spectrum allocation problem
Marenco, Javier; Bianchetti, Marcelo (Universidad Torcuato Di Tella, 2023)One of the most promising solutions to deal with huge data traffic demands in large communication networks is given by flexible optical networking, in particular the flexible grid (flexgrid) technology specified in the ... -
A polyhedral study of a relaxation of the routing and spectrum allocation problem
Marenco, Javier; Bertero, Federico; Kerivin, Herve; Wagler, Annegret (Procedia Computer ScienceElsevier, 2023)The routing and spectrum allocation (RSA) problem arises in the context of flexible grid optical networks, and consists in routing a set of demands through a network while simultaneously assigning a bandwidth to each ... -
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
Marenco, Javier (Universidad Torcuato Di Tella, 2023)We present a mixed integer programming formulation for the problem of clustering a set of points in Rd with axis-parallel clusters, while allowing to discard a pre-specified number of points, thus declared to be outliers. ... -
Facet-generating procedures for the maximum-impact coloring polytope
Marenco, Javier; Braga, Mónica (2023)Given two graphs G = (V, EG) and H = (V, EH) over the same set of vertices and given a set of colors C, the impact on H of a coloring c : V → C of G, denoted I(c), is the number of edges ij ∈ EH such that c(i) = c(j). ... -
Multiobjective formulation for last-mile optimization in wireless networks
Marenco, Javier; Micheletto, Matías; Santos, Rodrigo M. (IEEE2023 XLIX Latin American Computer Conference (CLEI), 2023)Internet of Things (IoT) is a technology that serves as the basis for smart environments. The ever-expanding set of applications that provide intelligence in different scenarios is continually growing and expanding. From ... -
The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
Marenco, Javier; Koch, Ivo (2022)Given a matrix with real-valued entries, the maximum 2D subarray problem consists in finding a rectangular submatrix with consecutive rows and columns maximizing the sum of its entries. In this work we start a polyhedral ... -
Valid inequalities and complete characterizations of the 2-domination and P3-hull number polytope
Marenco, Javier; Blaum, Manuela (Universidad Torcuato Di Tella, 2023)Given a graph G = (V;E), a subset S V is 2-dominating if every vertex in S has at least two neighbors in S. The minimum cardinality of such a set is called the 2-domination number of G. Consider a process in discrete ...