ListarArtículos presentados, aceptados y publicados por tema "Integer programming"
Mostrando ítems 1-7 de 7
-
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 ... -
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 ... -
Un algoritmo basado en la descomposición combinatoria de Benders para un problema de programación de tareas
(Universidad Torcuato Di Tella, 2024-08-29)En este trabajo consideramos un problema de programación de tareas para una institución deportiva. Se debe programar un conjunto de tareas a lo largo de varios días, y se tiene un conjunto de empleados que pueden realizar ... -
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. ... -
Analysis of a generalized Linear Ordering Problem via integer programming
(Discrete Applied Mathematics (e-ISSN: 1872-6771), 2019-12-01)We study a generalized version of the linear ordering problem: Given a collection of partial orders represented by directed trees with unique root and height one, where each tree is associated with a nonnegative reward, ... -
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 ...