Buscar
Mostrando ítems 1-5 de 5
Facet-generating procedures for the maximum-impact coloring polytope
(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). ...
The maximum 2D subarray polytope: facet-inducing inequalities and polyhedral computations
(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 ...
A polyhedral study of a relaxation of the routing and spectrum allocation problem
(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 ...
A branch-and-cut algorithm for the routing and spectrum allocation problem
(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 ...
An integer programming approach for the hyper-rectangular clustering problem with axis-parallel clusters and outliers
(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. ...